# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346833 | 2021-01-11T07:24:03 Z | arnold518 | Table Tennis (info1cup20_tabletennis) | C++14 | 1483 ms | 16496 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 15e4+400; const int MAXK = 400; const int MOD = 3000000+1; int N, K, A[MAXN+10]; int B[MOD+10]; int main() { scanf("%d%d", &N, &K); for(int i=1; i<=N+K; i++) scanf("%d", &A[i]); int tt=-1; for(int i=1; i<=N+K; i++) { int t=N+K-i+1; for(int j=max(i+1, t-K); j<=min(N+K, t+K); j++) { B[(A[i]+A[j])%MOD]+=2; if(B[(A[i]+A[j])%MOD]>=N) { tt=(A[i]+A[j])%MOD; break; } } if(tt!=-1) break; } vector<int> V; for(int i=1; i<=N+K; i++) { int t=N+K-i+1; for(int j=max(i+1, t-K); j<=min(N+K, t+K); j++) { if((A[i]+A[j])%MOD==tt) { V.push_back(A[i]); V.push_back(A[j]); } if(V.size()>=N) break; } if(V.size()>=N) break; } sort(V.begin(), V.end()); for(auto it : V) printf("%d ", it); printf("\n"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 876 KB | Output is correct |
2 | Correct | 48 ms | 3168 KB | Output is correct |
3 | Correct | 46 ms | 3168 KB | Output is correct |
4 | Correct | 47 ms | 3168 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 50 ms | 3168 KB | Output is correct |
2 | Correct | 49 ms | 3296 KB | Output is correct |
3 | Correct | 49 ms | 3168 KB | Output is correct |
4 | Correct | 53 ms | 3316 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 5868 KB | Output is correct |
2 | Correct | 3 ms | 2796 KB | Output is correct |
3 | Correct | 10 ms | 10476 KB | Output is correct |
4 | Correct | 10 ms | 8940 KB | Output is correct |
5 | Correct | 8 ms | 10348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 748 KB | Output is correct |
2 | Correct | 2 ms | 748 KB | Output is correct |
3 | Correct | 3 ms | 3180 KB | Output is correct |
4 | Correct | 3 ms | 2284 KB | Output is correct |
5 | Correct | 3 ms | 2540 KB | Output is correct |
6 | Correct | 2 ms | 1132 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 620 KB | Output is correct |
2 | Correct | 79 ms | 4192 KB | Output is correct |
3 | Correct | 89 ms | 7520 KB | Output is correct |
4 | Correct | 82 ms | 6368 KB | Output is correct |
5 | Correct | 82 ms | 6368 KB | Output is correct |
6 | Correct | 79 ms | 4832 KB | Output is correct |
7 | Correct | 79 ms | 5856 KB | Output is correct |
8 | Correct | 83 ms | 6112 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 10220 KB | Output is correct |
2 | Correct | 1461 ms | 14944 KB | Output is correct |
3 | Correct | 1483 ms | 16404 KB | Output is correct |
4 | Correct | 1157 ms | 16496 KB | Output is correct |
5 | Correct | 701 ms | 16216 KB | Output is correct |
6 | Correct | 659 ms | 6368 KB | Output is correct |
7 | Correct | 1130 ms | 16400 KB | Output is correct |
8 | Correct | 1103 ms | 16352 KB | Output is correct |