# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
807118 | 2023-08-04T13:31:59 Z | Benmath | Vision Program (IOI19_vision) | C++14 | 73 ms | 1052 KB |
#include "vision.h" #include<bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { std::vector<int> Ns; int a; for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ for(int k=0;k<H;k++){ for(int t=0;t<W;t++){ if((abs(i-k)+abs(j-t))==K){ Ns= {i*W+j,K*W+t}; a=add_and(Ns); } } } } } Ns.clear(); for(int i=H*W;i<=a;i++){ Ns.push_back(i); } a = add_or(Ns); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | on inputs (0, 0), (0, 1), expected 1, but computed 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 73 ms | 1052 KB | WA in grader: Too many instructions |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |