| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1044583 | YassineBenYounes | Vision Program (IOI19_vision) | C++17 | 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<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
freopen("milkvisits.in", "r", stdin);
freopen("milkvisits.out", "w", stdout);
}
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 3e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 320;
#include "vision.h"
/*
int ind = 0;
int last = 0;
int arr[mx];
int n, m, k;
int add_not(int x){
int y = !x;
last = y;
return arr[ind++] = y;
}
int add_and(vi v){
int y = 1;
for(int i : v){
y &= arr[i];
}
last = y;
return arr[ind++] = y;
}
int add_or(vi v){
int y = 0;
for(int i : v){
y |= arr[i];
}
last = y;
return arr[ind++] = y;
}
int add_xor(vi v){
int y = 0;
for(int i : v){
y ^= arr[i];
}
last = y;
return arr[ind++] = y;
}*/
void construct_network(int H, int W, int K) {
n=H,m=W,k=K;
ind = n*m;
vi rows;
for(int i = 0; i < n;i++){
vi v;
for(int j = 0;j < m;j++){
v.pb(i*n+j);
}
int x = add_or(v);
if(x == 1){
rows.pb(i);
}
}
if(rows.size() == 1)rows.pb(rows.back());
set<pii> s;
for(int i : rows){
for(int j = 0;j < m;j++){
int x = add_and({i*n+j});
if(x == 1)s.insert({i, j});
}
}
pii a = *s.begin();
pii b = *s.rbegin();
int dis = abs(a.ff - b.ff) + abs(a.ss - b.ss);
if(dis == k){
int x = add_and({a.ff*n+a.ss});
}
else{
int x = add_xor({a.ff*n+a.ss, b.ff*n+b.ss});
}
}
/*
int32_t main(){
init();
speed;
arr[0] = 1;
arr[1] = 1;
construct_network(3, 3, 2);
cout << last << endl;
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/