# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
865805 | 2023-10-24T16:48:26 Z | Lib | Vision Program (IOI19_vision) | C++14 | 7 ms | 1112 KB |
#include <bits/stdc++.h> #include "vision.h" using namespace std; vector <int> RowHasBlack; vector <int> ColumnHasBlack; vector <int> temp; int x,y; int OutputAns_BothRowColumnDifferent(int K, int x2, int y2){ //return ( ((RowHasBlack[1]-RowHasBlack[0]) + (ColumnHasBlack[1]-ColumnHasBlack[0]) == K) ); int res; if(abs(RowHasBlack[1]-RowHasBlack[0]) + abs(ColumnHasBlack[1]-ColumnHasBlack[0]) == K){ RowHasBlack.clear(); ColumnHasBlack.clear(); return add_not(y2); }else{ RowHasBlack.clear(); ColumnHasBlack.clear(); return add_not(x2); } //return RowHasBlack[1]; } int OutputCert(int K){ return add_not(0); } void construct_network(int H, int W, int K){ for(int i=0;i<H;i++){ temp.clear(); for(int k=0;k<W;k++){ temp.push_back(i*W+k); } if(add_or(temp)){ RowHasBlack.push_back(i); x=H*W+i; }else{ y=W*i; } } for(int i=0;i<W;i++){ temp.clear(); for(int k=0;k<H;k++){ temp.push_back(k*W+i); } if(add_or(temp)){ ColumnHasBlack.push_back(i); }else{ y=i; } } for(int i=0;i<H*W;i++){ if(add_not(i)){ y=i; break; }else{ x=i; } } if(H*W==2){ OutputCert(K); }else if(RowHasBlack.size()==2&&ColumnHasBlack.size()==2){ OutputAns_BothRowColumnDifferent(K,x,y); }else{ if(RowHasBlack.size()==1){ RowHasBlack.push_back(RowHasBlack[0]); }else{ ColumnHasBlack.push_back(ColumnHasBlack[0]); } OutputAns_BothRowColumnDifferent(K,x,y); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 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 | 0 ms | 344 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 | 0 ms | 344 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 | 0 ms | 344 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 | 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 | 0 ms | 348 KB | on inputs (0, 0), (1, 0), expected 1, but computed 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 1112 KB | on inputs (126, 120), (176, 169), expected 0, but computed 1 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | on inputs (0, 0), (0, 1), expected 1, but computed 0 |
2 | Halted | 0 ms | 0 KB | - |