#include<bits/stdc++.h>
#include "vision.h"
#define fi first
#define se second
#define ll long long
using namespace std ;
vector<int> abu ;
//int add_xor(vector<int> v)
//{
// int num = 0 ;
// cout << "XOR ? " ;
// for(int i : v)
// {
// num ^= abu[i] ;
// cout << i << ' ' ;
// }
// cout << '\n' ;
// abu.push_back(num) ;
// return abu.size() - 1 ;
//}
//int add_or(vector<int> v)
//{
// int num = 0 ;
// cout << "OR ? " ;
// for(int i : v)
// {
// num |= abu[i] ;
// cout << i << ' ' ;
// }
// cout << '\n' ;
// abu.push_back(num) ;
// return abu.size() - 1 ;
//}
//int add_and(vector<int> v)
//{
// int num = abu[v[0]] ;
// cout << "AND ? " ;
// for(int i : v)
// {
// num &= abu[i] ;
// cout << i << ' ' ;
// }
// abu.push_back(num) ;
// cout << '\n' ;
// return abu.size() - 1 ;
//}
void construct_network(int n, int m, int k)
{
vector<int> arr_l, arr_l_k1, arr_l_k, arr_r, arr_r_k1, arr_r_k ;
for(int i = n - 1 ; i >= 0 ; i--)
{
int x = i, y = 0 ;
vector<int> now ;
while(x < n && y < m)
{
now.push_back(x * m + y) ;
x++ ;
y++ ;
}
arr_l.push_back(add_or(now)) ;
}
for(int i = 1 ; i < m ; i++)
{
int x = 0, y = i ;
vector<int> now ;
while(x < n && y < m)
{
now.push_back(x * m + y) ;
x++ ;
y++ ;
}
arr_l.push_back(add_or(now)) ;
}
for(int i = k - 1 ; i < arr_l.size() ; i++)
{
vector<int> now ;
for(int j = i - k + 1 ; j <= i ; j++)
now.push_back(arr_l[j]) ;
arr_l_k.push_back(add_xor({add_xor(now), add_or(now)})) ;
}
for(int i = k ; i < arr_l.size() ; i++)
{
vector<int> now ;
for(int j = i - k ; j <= i ; j++)
now.push_back(arr_l[j]) ;
arr_l_k1.push_back(add_xor({add_xor(now), add_or(now)})) ;
}
for(int i = 0 ; i < m ; i++)
{
int x = 0, y = i ;
vector<int> now ;
while(x >= 0 && y >= 0)
{
now.push_back(x * m + y) ;
x++ ;
y-- ;
}
arr_r.push_back(add_or(now)) ;
}
for(int i = 1 ; i < n ; i++)
{
int x = i, y = m - 1 ;
vector<int> now ;
while(x >= 0 && y >= 0)
{
now.push_back(x * m + y) ;
x++ ;
y-- ;
}
arr_r.push_back(add_or(now)) ;
}
for(int i = k - 1 ; i < arr_r.size() ; i++)
{
vector<int> now ;
for(int j = i - k + 1 ; j <= i ; j++)
now.push_back(arr_r[j]) ;
arr_r_k.push_back(add_xor({add_xor(now), add_or(now)})) ;
}
for(int i = k ; i < arr_r.size() ; i++)
{
vector<int> now ;
for(int j = i - k ; j <= i ; j++)
now.push_back(arr_r[j]) ;
arr_r_k1.push_back(add_xor({add_xor(now), add_or(now)})) ;
}
int num1 = add_and({add_or(arr_r_k1), add_or(arr_l_k1)}), num2 = add_and({add_or(arr_r_k), add_or(arr_l_k)}) ;
add_xor({num1, num2}) ;
// cout << "Left\n" ;
// for(int i : arr_l)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
// cout << "Left dist k\n" ;
// for(int i : arr_l_k)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
// cout << "Left dist k + 1\n" ;
// for(int i : arr_l_k1)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
// cout << "Right\n" ;
// for(int i : arr_r)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
// cout << "Right dist k\n" ;
// for(int i : arr_r_k)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
// cout << "Right dist k + 1\n" ;
// for(int i : arr_r_k1)
// cout << abu[i] << ' ' ;
// cout << '\n' ;
}
//signed main()
//{
// int t ;
// cin >> t ;
// while(t--)
// {
// int n, m, k ;
// cin >> n >> m >> k ;
// for(int i = 0 ; i < n ; i++)
// for(int j = 0 ; j < m ; j++)
// {
// int a ;
// cin >> a ;
// abu.push_back(a) ;
// }
// construct_network(n, m, k) ;
// for(int i : abu)
// cout << i << ' ' ;
// cout << '\n' ;
// abu.clear() ;
// }
// return 0 ;
//}
Compilation message
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:74:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for(int i = k - 1 ; i < arr_l.size() ; i++)
| ~~^~~~~~~~~~~~~~
vision.cpp:81:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
81 | for(int i = k ; i < arr_l.size() ; i++)
| ~~^~~~~~~~~~~~~~
vision.cpp:112:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
112 | for(int i = k - 1 ; i < arr_r.size() ; i++)
| ~~^~~~~~~~~~~~~~
vision.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
119 | for(int i = k ; i < arr_r.size() ; i++)
| ~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
340 KB |
WA in grader: Invalid index |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (1, 0), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
724 KB |
WA in grader: Invalid index |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
