# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072352 | 2024-08-23T17:24:53 Z | hasan2006 | Vision Program (IOI19_vision) | C++17 | 2 ms | 2008 KB |
#include <bits/stdc++.h> #include "vision.h" using namespace std; #define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); #define rall(s) s.rbegin(),s.rend() #define all(s) s.begin(),s.end() #define pb push_back #define se second #define fi first #define ll long long #define ld long double #define YES cout<<"YES\n" #define Yes cout<<"Yes\n" #define yes cout<<"yes\n" #define NO cout<<"NO\n" #define No cout<<"No\n" #define no cout<<"no\n" const int N = 5e5 + 9 , mod = 1e9 + 7; ll a[N] , b[N] , dp[N] , c[N] , d[N] ; void construct_network(int n, int m, int k){ int i , j ,l , r , s , f , x , y ; vector<int>a[n] , b[m]; for(i = 0; i < n; i++){ for(j = 0; j < m; j++){ a[i].pb(i * n + j); b[j].pb(i * n + j); } } vector<int>v1 , v2 , vc; for(i = 0; i < n; i++) if(add_or(a[i])) v1.pb(i); for(i = 0; i < m; i++) if(add_or(b[i])) v2.pb(i); vector<pair<int,int>>v ; for(auto to : v1) for(auto to1 : v2) if(add_and({to * n + to1})) v.pb({to , to1}) , vc.pb(to * n + to1); if(abs(v[0].fi - v[1].fi) + abs(v[0].se - v[1].se) == k) add_xor(vc); else add_or(vc); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 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 | Incorrect | 0 ms | 348 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 | Incorrect | 0 ms | 348 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 | Incorrect | 0 ms | 348 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 | Incorrect | 0 ms | 344 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 | Incorrect | 0 ms | 348 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 | Incorrect | 2 ms | 2008 KB | WA in grader: Too many instructions |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | on inputs (0, 0), (0, 1), expected 1, but computed 0 |
2 | Halted | 0 ms | 0 KB | - |