# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823756 | vjudge1 | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 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"
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 200, M = 200 ;
bool a[n][m] ;
//int add_not(vector<int> v)
//{
//}
//int add_and(vector<int> v)
//{
//}
//int add_or(vector<int> v)
//{
//}
//int add_xor()
//{
//}
void construct_network(int n, int m, int k)
{
bool flag = 0 ;
if(n <= 10 && m <= 10)
{
for(int x1 = 0 ; x1 < n ; x1++)
for(int y1 = 0 ; y1 < m ; y1++)
for(int x2 = 0 ; x2 < n ; x2++)
for(int y2 = 0 ; y2 < m ; y2++)
{
vector<int> v ;
v.push_back(x1 * m + y1) ;
v.push_back(x2 * m + y2) ;
if(add_or(v) == 1 && add_xor(v) == 0)
{
add_or(v) ;
return ;
}
}
}
}
//signed main()
//{
// int n, m, k ;
// cin >> n >> m >> k ;
// for(int i = 0 ; i < n ; i++)
// for(int j = 0 ; j < n ; j++)
// cin >> a[i][j] ;
// construct_network(n, m, k) ;
// return 0 ;
//}