Submission #590293

#TimeUsernameProblemLanguageResultExecution timeMemory
590293farhan132Vision Program (IOI19_vision)C++17
8 / 100
1 ms468 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; typedef int ll; typedef pair<ll , ll> ii; #define ff first #define ss second #define pb push_back #define in insert ii num(ll m, ll x){ return {x/m, x%m}; } ll N,M; ll convo(ll x, ll y){ return x * (M) + y; } void construct_network(int H, int W, int K) { N = H, M = W; ll n = H * W - 1; vector < ll > a(n, 0); //ll tot = 0; vector < ll > v; for(ll i = 0; i < 1; i++){ for(ll j = 0; j < 1; j++){ for(ll x = i; x < H; x++){ for(ll y = 0; y < W; y++){ if((abs(x - i) + abs(y - j)) != K) continue; v.pb(add_and({convo(i, j), convo(x, y)})); //cout << i << ' ' << j << ' ' << x << " " << y << '\n'; } } } } add_or(v); } // 1,2,5
#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...