QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#368054	#6342. Security Guard	ltunjic^#	12	13ms	1644kb	C++14	434b	2024-03-26 19:18:42	2024-07-04 03:32:01

Judging History

你现在查看的是最新测评结果

[2024-07-04 03:32:01]
评测

测评结果：12
用时：13ms
内存：1644kb

查看

[2024-03-26 19:18:42]
提交

answer

#include <cstdio> 
#include <algorithm>

using namespace std;

int _abs(int x) { return x < 0 ? -x : x; }

int main() {
	int n, m, q; scanf("%d%d%d", &n, &m, &q); 
	int ans = 0;
	for(int i = 0, lst = 0, flag = 0; i < n; ++i) {
		int x; scanf("%d", &x);
		ans += min(lst, x); 
        flag |= x == 2; 
		if(lst == 1 && x == 2 || x == 1 && i == n - 1 && flag) ++ans;
		lst = x;
	}
	printf("%d\n", ans);
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 12

Accepted

Test #1:

score: 12

Accepted

time: 5ms

memory: 1612kb

input:

200000 199999 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

output:

result:

ok 1 number(s): "199999"

Test #2:

score: 0

Accepted

time: 5ms

memory: 1552kb

input:

200000 199999 0
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

output:

result:

ok 1 number(s): "399998"

Test #3:

score: 0

Accepted

time: 9ms

memory: 1604kb

input:

200000 199999 0
1 2 1 1 1 2 2 1 2 1 1 2 2 2 2 1 1 2 1 1 1 1 2 2 2 1 1 2 2 1 1 1 2 1 1 2 1 1 1 1 1 1 1 2 1 2 2 1 2 1 1 2 1 2 2 2 2 1 2 2 1 2 1 2 2 2 1 1 1 2 1 1 1 2 2 1 1 1 2 2 2 2 1 1 2 2 1 1 2 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 1 2 1 1 2 1 1 1 2 2 2 1 2 1 1 1 2 1 2 2 2 1 2 1 1 1 1 2 2 1 1 2 1 2 1 2 1 2 ...

output:

result:

ok 1 number(s): "299700"

Test #4:

score: 0

Accepted

time: 9ms

memory: 1644kb

input:

200000 199999 0
2 2 1 2 1 2 2 2 1 1 2 2 1 2 1 2 1 1 2 2 2 2 1 1 2 2 2 1 1 1 1 1 2 2 1 2 2 2 2 1 2 1 2 2 1 1 2 1 1 2 2 2 1 1 2 2 2 2 2 2 2 2 1 2 2 2 1 2 2 2 2 2 2 2 1 1 1 2 1 1 1 1 2 1 1 1 2 2 2 2 1 2 2 2 1 1 1 2 1 2 2 1 2 1 1 1 1 2 1 1 1 1 1 2 1 2 1 2 2 2 2 2 1 2 2 1 2 1 2 1 1 2 1 2 2 1 2 2 1 2 1 1 ...

output:

result:

ok 1 number(s): "300131"

Test #5:

score: 0

Accepted

time: 9ms

memory: 1580kb

input:

200000 199999 0
1 2 2 1 1 1 1 2 2 1 2 2 1 2 1 1 1 1 2 1 1 2 1 1 1 1 2 1 1 1 1 2 2 2 1 2 1 1 2 1 2 2 1 1 2 2 2 2 1 2 1 2 2 1 1 1 2 1 1 2 1 1 2 2 1 2 2 2 2 2 1 2 2 2 1 2 2 1 1 2 2 2 1 2 2 2 1 1 2 1 2 2 2 1 2 2 1 2 1 1 2 1 2 2 2 1 2 1 1 1 1 2 1 1 1 2 1 2 2 2 1 2 2 1 2 1 1 1 1 1 2 1 1 2 1 2 1 1 2 2 2 2 ...

output:

result:

ok 1 number(s): "300132"

Test #6:

score: 0

Accepted

time: 9ms

memory: 1612kb

input:

200000 199999 0
2 1 1 2 2 2 1 1 2 2 1 2 2 2 1 1 1 2 1 2 2 1 1 1 1 2 1 2 1 1 1 1 2 2 1 1 1 1 2 1 2 2 2 2 1 1 1 1 2 2 2 1 1 2 2 2 1 2 2 2 1 1 1 1 1 1 1 2 2 2 2 1 2 2 1 2 1 1 1 2 2 1 2 2 1 1 1 2 2 2 2 2 2 2 2 1 1 2 1 2 2 1 2 1 2 1 1 1 1 2 1 1 2 2 2 2 1 1 1 2 1 2 1 1 1 1 2 1 1 1 1 1 1 2 1 2 1 2 1 2 1 1 ...

output:

result:

ok 1 number(s): "300094"

Test #7:

score: 0

Accepted

time: 0ms

memory: 1604kb

input:

2 1 0
2 1
1 2

output:

result:

ok 1 number(s): "2"

Subtask #2:

score: 0

Wrong Answer

Dependency #1:

100%

Accepted

Test #8:

score: 0

Wrong Answer

time: 13ms

memory: 1620kb

input:

200000 199999 0
888688136 635144878 255996991 457498818 501986248 161166265 760280211 255673948 435333678 521749421 41382586 784453705 702026010 746126 770719498 150796793 890458633 167539898 952822340 613539963 472897894 866040523 778440023 870323479 702145156 736556675 190255428 993487185 74569854...

output:

-657960205

result:

wrong answer 1st numbers differ - expected: '99991732542677', found: '-657960205'

Subtask #3:

score: 0

Skipped

Dependency #2:

Subtask #4:

score: 0

Skipped

Dependency #3:

Subtask #5:

score: 0

Wrong Answer

Test #85:

score: 0

Wrong Answer

time: 0ms

memory: 1644kb

input:

16 15 200000
692461146 622302385 805066691 422290641 600839873 940930580 873147413 489653843 239129952 383473127 21389393 913787109 856138328 859082963 262475462 327598064
6 13
6 9
6 15
6 14
6 16
6 8
5 6
1 6
4 6
3 6
6 11
6 7
6 10
2 6
6 12

output:

-1778841141

result:

wrong answer 1st numbers differ - expected: '14113958700', found: '-1778841141'

Subtask #6:

score: 0

Skipped

Dependency #5:

Subtask #7:

score: 0

Skipped

Dependency #1:

100%

Accepted