# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892808 | 2023-12-26T02:57:40 Z | Sir_Ahmed_Imran | Vision Program (IOI19_vision) | C++17 | 1 ms | 604 KB |
///~~~LOTA~~~/// #include "vision.h" #include <bits/stdc++.h> using namespace std; #define nl '\n' #define ff first #define ss second #define ll long long #define append push_back #define pii pair<int,int> #define all(x) (x).begin(),(x).end() #define N 100001 void construct_network(int n,int m,int k){ int p,q,r,s; r=n*m-1; vector<int> u,v; for(int i=0;i<n;i++){ r++; u.clear(); for(int j=0;j<m;j++) u.append(i*m+j); if(add_or(u)) v.append(i); } p=v[0]; q=v.back(); v.clear(); for(int i=0;i<m-k+q-p;i++){ r++; u={p*m+i,q*m+i+k-q+p}; s=add_and(u); v.append(r); r++; u={p*m+i+k-q+p,q*m+i}; s=add_and(u); v.append(r); } s=add_or(v); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 500 KB | WA in grader: Invalid index |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 500 KB | WA in grader: Invalid index |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 500 KB | WA in grader: Invalid index |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 500 KB | WA in grader: Invalid index |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 436 KB | Output is correct |
5 | Incorrect | 0 ms | 348 KB | WA in grader: Invalid index |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 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 | 1 ms | 604 KB | WA in grader: Invalid index |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 500 KB | WA in grader: Invalid index |
4 | Halted | 0 ms | 0 KB | - |