# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933214 | thunopro | Vision Program (IOI19_vision) | C++14 | 2 ms | 984 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<bits/stdc++.h>
#include "vision.h"
using namespace std ;
#define maxn 200009
#define ll long long
#define pb push_back
#define fi first
#define se second
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<pii> vii ;
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void add ( int &a , int b )
{
a += b ;
if ( a >= mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
//void construct_network ( int H , int W , int K ) ;
//bool NOT ( int cell ) ;
//bool AND ( vi cell ) ;
//bool OR ( vi cell ) ;
//bool XOR ( vi cell ) ;
//
//int main ()
//{
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
//// rf () ;
// construct_network ( 2 , 3 , 3 ) ;
//}
//
//bool NOT ( int cell )
//{
// if ( cell == 0 || cell == 5 ) return 0 ;
// return 1 ;
//}
//bool AND ( vi cell )
//{
// int x ; cin >> x ;
// return x ;
//}
//bool OR ( vi cell )
//{
// int x ; cin >> x ;
// return x ;
//}
//bool XOR ( vi cell )
//{
// int x ; cin >> x ;
// return x ;
//}
int h , w , k ;
pii get_cell ( int cell )
{
return {cell/w,cell%w} ;
}
void construct_network ( int H , int W , int K )
{
h = H , w = W , k = K ;
pii fir = {-1,0} , sec = {0,0} ; int pos ;
for ( int i = 0 ; i < h*w ; i ++ )
{
if ( add_not (i) == 0 && fir.fi == -1 ) fir = get_cell (i) , pos = i ;
else if ( add_not (i) == 0 ) sec = get_cell (i) ;
}
int res ;
if ( abs(fir.fi-sec.fi) + abs(fir.se-sec.se) == k ) res = (add_not(pos)==0) ;
else res = add_not(pos) ;
}
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... |