Submission #519220

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
519220	2022-01-26T03:38:38 Z	amunduzbaev	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	4 / 100	3000 ms	1528 KB

fortune_telling2

#include "bits/stdc++.h"
using namespace std;

#define ar array

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k; cin>>n>>k;
	vector<ar<int, 2>> a(n);
	for(int i=0;i<n;i++) cin>>a[i][0]>>a[i][1];
	vector<int> t(n);
	for(int i=0;i<k;i++){
		int x; cin>>x;
		for(int j=0;j<n;j++){
			if(a[j][t[j]] <= x) t[j] ^= 1;
		}
	}
	
	long long res = 0;
	for(int i=0;i<n;i++) res += a[i][t[i]];
	
	cout<<res<<"\n";
}

Subtask #1

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	4 ms	324 KB	Output is correct
4	Correct	4 ms	332 KB	Output is correct
5	Correct	4 ms	332 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	4 ms	324 KB	Output is correct
8	Correct	2 ms	304 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	332 KB	Output is correct
12	Correct	4 ms	332 KB	Output is correct
13	Correct	6 ms	332 KB	Output is correct

Subtask #2

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	4 ms	324 KB	Output is correct
4	Correct	4 ms	332 KB	Output is correct
5	Correct	4 ms	332 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	4 ms	324 KB	Output is correct
8	Correct	2 ms	304 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	332 KB	Output is correct
12	Correct	4 ms	332 KB	Output is correct
13	Correct	6 ms	332 KB	Output is correct
14	Correct	340 ms	700 KB	Output is correct
15	Correct	1372 ms	1044 KB	Output is correct
16	Execution timed out	3024 ms	1528 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	4 ms	324 KB	Output is correct
4	Correct	4 ms	332 KB	Output is correct
5	Correct	4 ms	332 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	4 ms	324 KB	Output is correct
8	Correct	2 ms	304 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	332 KB	Output is correct
12	Correct	4 ms	332 KB	Output is correct
13	Correct	6 ms	332 KB	Output is correct
14	Correct	340 ms	700 KB	Output is correct
15	Correct	1372 ms	1044 KB	Output is correct
16	Execution timed out	3024 ms	1528 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-