답안 #644582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
644582	2022-09-25T03:21:32 Z	ymm	운세 보기 2 (JOI14_fortune_telling2)	C++17	35 / 100	3000 ms	1108 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)
{
	Loop (i,0,n)
		a[i] ^= a[i] <= x? 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];
	}
	while (q--) {
		int t;
		cin >> t;
		up(t);
	}
	ll ans = 0;
	Loop (i,0,n)
		ans += a[i];
	cout << ans << '\n';
}

Subtask #1

4.0 / 4.0

#	결과	실행 시간	메모리	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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 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	212 KB	Output is correct

Subtask #2

31.0 / 31.0

#	결과	실행 시간	메모리	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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 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	212 KB	Output is correct
14	Correct	18 ms	408 KB	Output is correct
15	Correct	62 ms	468 KB	Output is correct
16	Correct	138 ms	468 KB	Output is correct
17	Correct	248 ms	624 KB	Output is correct
18	Correct	236 ms	596 KB	Output is correct
19	Correct	244 ms	588 KB	Output is correct
20	Correct	240 ms	620 KB	Output is correct
21	Correct	236 ms	624 KB	Output is correct
22	Correct	234 ms	624 KB	Output is correct
23	Correct	243 ms	636 KB	Output is correct
24	Correct	232 ms	612 KB	Output is correct
25	Correct	232 ms	596 KB	Output is correct
26	Correct	195 ms	572 KB	Output is correct
27	Correct	247 ms	596 KB	Output is correct
28	Correct	234 ms	624 KB	Output is correct
29	Correct	247 ms	716 KB	Output is correct

Subtask #3

0 / 65.0

#	결과	실행 시간	메모리	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	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 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	212 KB	Output is correct
14	Correct	18 ms	408 KB	Output is correct
15	Correct	62 ms	468 KB	Output is correct
16	Correct	138 ms	468 KB	Output is correct
17	Correct	248 ms	624 KB	Output is correct
18	Correct	236 ms	596 KB	Output is correct
19	Correct	244 ms	588 KB	Output is correct
20	Correct	240 ms	620 KB	Output is correct
21	Correct	236 ms	624 KB	Output is correct
22	Correct	234 ms	624 KB	Output is correct
23	Correct	243 ms	636 KB	Output is correct
24	Correct	232 ms	612 KB	Output is correct
25	Correct	232 ms	596 KB	Output is correct
26	Correct	195 ms	572 KB	Output is correct
27	Correct	247 ms	596 KB	Output is correct
28	Correct	234 ms	624 KB	Output is correct
29	Correct	247 ms	716 KB	Output is correct
30	Correct	301 ms	340 KB	Output is correct
31	Correct	1472 ms	596 KB	Output is correct
32	Execution timed out	3053 ms	1108 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-