# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834664 | tranxuanbach | Vision Program (IOI19_vision) | C++17 | 38 ms | 4468 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>
using namespace std;
const int N = 2e2 + 5, M = 1e4 + 5;
int n, m, k;
int cnt_dia;
vector <int> query;
int offset_tmp;
int offset_original;
int zero, one;
int offset_maindia; // y - x
int offset_antidia; // y + x
int offset_k_maindia;
int offset_k_antidia;
int offset_kn1_maindia;
int offset_kn1_antidia;
int same_maindia;
int same_antidia;
int within_k;
int within_kn1;
void construct_network(int _n, int _m, int _k){
# | 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... |