제출 #291463

#제출 시각아이디문제언어결과실행 시간메모리
291463mohammadVision Program (IOI19_vision)C++14
14 / 100
10 ms1152 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; #define endl "\n" // #define int long long typedef long long ll ; const ll ooo = 1e14 ; const ll oo = 2e9 ; const double PI = acos(-1) ; const ll M = 1e9 + 7 ; const int N = 10000010 ; map<pair<int , int> , int > mp , use; vector<pair<int,int>> v[410] ; int d[222][222] ; void construct_network(int H, int W, int K) { vector<int> Ns , f; vector<int> r , c; for(int i = 0 ; i < H ; ++i){ Ns.clear(); for(int j = 0 ; j < W ; ++j) Ns.push_back(i * W + j); r.push_back(add_or(Ns)); } int ro = add_xor(r); for(int j = 0 ; j < W ; ++j){ Ns.clear(); for(int i = 0 ; i < H ; ++i) Ns.push_back(i * W + j); c.push_back(add_or(Ns)); } int co = add_xor(c); for(int i = 0 ; i < H - 1 ; ++i){ Ns = {r[i] , r[i + 1] , co}; f.push_back(add_and(Ns)); } for(int i = 0 ; i < W - 1 ; ++i){ Ns = {c[i] , c[i + 1] , ro}; f.push_back(add_and(Ns)); } add_or(f); return ; } // freopen("C:\\Users\\mhmdsa\\Documents\\c++\\input.txt" , "r" , stdin ); // freopen("C:\\Users\\mhmdsa\\Documents\\c++\\output.txt" , "w" , stdout );
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...