# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223390 | 2020-04-15T08:32:03 Z | dantoh000 | Matching (COCI20_matching) | C++14 | 11 ms | 2944 KB |
#include <bits/stdc++.h> using namespace std; vector<int> ans[100005]; int main(){ int n; scanf("%d",&n); for (int i = 0; i < n; i++ ){ int x,y; scanf("%d%d",&x,&y); ans[x].push_back(i+1); } printf("DA\n"); for (int i = 0; i <= 100000; i++){ for (auto x : ans[i]) printf("%d ",x); printf("\n"); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2944 KB | Output is correct |
2 | Correct | 9 ms | 2816 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2944 KB | Output is correct |
2 | Correct | 9 ms | 2816 KB | Output is correct |
3 | Correct | 10 ms | 2816 KB | Output is correct |
4 | Correct | 9 ms | 2816 KB | Output is correct |
5 | Incorrect | 11 ms | 2816 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2944 KB | Output is correct |
2 | Correct | 9 ms | 2816 KB | Output is correct |
3 | Correct | 10 ms | 2816 KB | Output is correct |
4 | Correct | 9 ms | 2816 KB | Output is correct |
5 | Incorrect | 11 ms | 2816 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2944 KB | Output is correct |
2 | Correct | 9 ms | 2816 KB | Output is correct |
3 | Correct | 10 ms | 2816 KB | Output is correct |
4 | Correct | 9 ms | 2816 KB | Output is correct |
5 | Incorrect | 11 ms | 2816 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 2944 KB | Output is correct |
2 | Correct | 9 ms | 2816 KB | Output is correct |
3 | Correct | 10 ms | 2816 KB | Output is correct |
4 | Correct | 9 ms | 2816 KB | Output is correct |
5 | Incorrect | 11 ms | 2816 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |