# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282840 | muhammad_hokimiyon | Vision Program (IOI19_vision) | C++14 | 2 ms | 1148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
int dist( int x1 , int y1 , int x2 , int y2 )
{
return abs(x1 - x2) + abs(y1 - y2);
}
void construct_network(int H, int W, int K)
{
int n = H;
int m = W;
vector < pair < int , int > > ask;
for( int i = 0; i < n; i++ ){
for( int j = 0; j < m; j++ ){
if( i == n - 1 && j == m - 1 )continue;
int x = 1 - add_not( i * m + j );
ask.push_back({ x , i * m + j });
}
}
int f = 0;
vector < int > res;
for( auto x : ask ){
if( x.first == 1 ){
res.push_back( x.second );
}else{
f = x.second;
}
}
if( (int)res.size() == 1 ){
res.push_back( n * m - 1 );
}
int x = dist( res[0] / m , res[0] % m , res[1] / m , res[1] % m );
if( x == K ){
int ans = add_not( res[0] );
}else{
int ans = add_not( f );
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |