#include "vision.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll h , w , k , q, dp[105][100005], a[555555] , b[555555], l, m, n, o, p;
map < ll , ll > mp;
vll o1[555555] , o2[555555];
const ll mod = 1e9+7;
str s;
ll pos(ll i , ll j){
R i * w + j ;
}
void construct_network(int H, int W, int K) {
h = H , w = W , k = K ;
vll xor1 , no , or1 , and1 , op;
for(ll i = 0 ; i < w ; i++){
for(ll j = 0 ; j < h ; j++){
o1[i].pb(j * w + i) ;
}
}
for(ll i = 0 ; i < h ; i++){
for(ll j = 0 ; j < w ; j++){
o2[i].pb(pos(i , j)) ;
//cout << pos(i , j) << " " ;
}
}
for(ll i = 0 ; i < w ; i++){
vll &u = o1[i] ;
or1.pb(add_or(u)) ;
xor1.pb(add_xor(u)) ;
}
for(ll i = 0 ; i < h ; i++){
vll &u = o2[i] ;
or1.pb(add_or(u)) ;
xor1.pb(add_xor(u)) ;
}
for(auto u : xor1){
no.pb(add_not(u)) ;
}
for(ll i = 0 ; i < sz(no) ; i++){
and1.pb(add_and({no[i] , or1[i]})) ;
if(i == h - 1)C ;
op.pb(add_and({or1[i] , or1[i + 1]})) ;
}
ll op1 = add_or(and1) , op2 = add_or(op) ;
add_and({op1 , op2}) ;
}
Compilation message
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:68:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | for(ll i = 0 ; i < sz(no) ; i++){
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
26308 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
26308 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
26308 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
26308 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
23 ms |
26444 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 |
Correct |
20 ms |
26368 KB |
Output is correct |
| 2 |
Incorrect |
19 ms |
26316 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
28356 KB |
Output is correct |
| 2 |
Correct |
22 ms |
26316 KB |
Output is correct |
| 3 |
Incorrect |
24 ms |
26444 KB |
WA in grader: Invalid index |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
26308 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
| 2 |
Halted |
0 ms |
0 KB |
- |
