Submission #294848

#TimeUsernameProblemLanguageResultExecution timeMemory
294848egekabasVision Program (IOI19_vision)C++14
8 / 100
1 ms256 KiB
#include "vision.h" #include <bits/stdc++.h> #define all(x) (x).begin(), (x).end() #define ff first #define ss second #define pb push_back #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> pll; typedef pair<ull, ull> pull; typedef pair<int, int> pii; typedef pair<ld, ld> pld; void construct_network(int H, int W, int K){ vector<int> finalcomp; for(int i = 0; i < 1; ++i) for(int j = 0; j < 1; ++j){ vector<int> fr; for(int i1 = 0; i1 < H; ++i1) for(int j1 = 0; j1 < W; ++j1) if(abs(i1-i)+abs(j1-j) == K) fr.pb(i1*W+j1); if(fr.size()) finalcomp.pb(add_and({i*W+j, add_or(fr)})); } add_or(finalcomp); }
#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...