Submission #644588

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
644588	2022-09-25T03:33:29 Z	ymm	Fortune Telling 2 (JOI14_fortune_telling2)	C++17	35 / 100	3000 ms	2252 KB

fortune_telling2

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 200'010;
int a[N], b[N];
int n;

__attribute__((optimize("O3,unroll-loops"),target("avx2")))
void up(int x, int y)
{
	Loop (i,0,n) {
		a[i] ^= a[i] <= x? b[i]: 0;
		a[i] ^= a[i] <= y? b[i]: 0;
	}
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int q;
	cin >> n >> q;
	Loop (i,0,n) {
		cin >> a[i] >> b[i];
		b[i] ^= a[i];
	}
	for (int i = 0; i < q; i += 2) {
		int x, y;
		cin >> x;
		i+1 < q? cin >> y, 0: (y = 0);
		up(x, y);
	}
	ll ans = 0;
	Loop (i,0,n)
		ans += a[i];
	cout << ans << '\n';
}

Subtask #1

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct

Subtask #2

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	13 ms	416 KB	Output is correct
15	Correct	45 ms	468 KB	Output is correct
16	Correct	96 ms	548 KB	Output is correct
17	Correct	169 ms	628 KB	Output is correct
18	Correct	173 ms	624 KB	Output is correct
19	Correct	168 ms	596 KB	Output is correct
20	Correct	197 ms	620 KB	Output is correct
21	Correct	168 ms	552 KB	Output is correct
22	Correct	178 ms	620 KB	Output is correct
23	Correct	166 ms	596 KB	Output is correct
24	Correct	175 ms	596 KB	Output is correct
25	Correct	176 ms	628 KB	Output is correct
26	Correct	143 ms	592 KB	Output is correct
27	Correct	181 ms	624 KB	Output is correct
28	Correct	188 ms	596 KB	Output is correct
29	Correct	169 ms	620 KB	Output is correct

Subtask #3

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	13 ms	416 KB	Output is correct
15	Correct	45 ms	468 KB	Output is correct
16	Correct	96 ms	548 KB	Output is correct
17	Correct	169 ms	628 KB	Output is correct
18	Correct	173 ms	624 KB	Output is correct
19	Correct	168 ms	596 KB	Output is correct
20	Correct	197 ms	620 KB	Output is correct
21	Correct	168 ms	552 KB	Output is correct
22	Correct	178 ms	620 KB	Output is correct
23	Correct	166 ms	596 KB	Output is correct
24	Correct	175 ms	596 KB	Output is correct
25	Correct	176 ms	628 KB	Output is correct
26	Correct	143 ms	592 KB	Output is correct
27	Correct	181 ms	624 KB	Output is correct
28	Correct	188 ms	596 KB	Output is correct
29	Correct	169 ms	620 KB	Output is correct
30	Correct	219 ms	388 KB	Output is correct
31	Correct	1002 ms	704 KB	Output is correct
32	Correct	2023 ms	1108 KB	Output is correct
33	Execution timed out	3068 ms	2252 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-