# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617490 | 2fat2code | Vision Program (IOI19_vision) | C++17 | 1075 ms | 1404 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 "vision.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
//#define int long long
#define all(s) s.begin(), s.end()
#define rc(s) return cout << s, 0
using namespace std;
vector<pair<int,int>>dist;
void construct_network(int H, int W, int K) {
vector<int> Ns;
for(int i1=0;i1<H;i1++){
for(int j1=0;j1<W;j1++){
for(int i2=0;i2<H;i2++){
for(int j2=0;j2<W;j2++){
if(abs(i1 - i2) + abs(j2 - j1) == K){
dist.push_back({i1 * W + j1, i2 * W + j2});
}
}
}
}
}
sort(all(dist));
dist.resize(unique(all(dist)) - dist.begin());
for(auto it : dist){
Ns.clear();
Ns.push_back(it.fr);
Ns.push_back(it.sc);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |