# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224965 | VEGAnn | Konj (COCI19_konj) | C++14 | 86 ms | 5224 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 <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define MP make_pair
#define PB push_back
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
const int N = 310;
const int oo = 2e9;
queue<pii> q;
pii hr[N][N], vr[N][N];
vector<array<int, 3> > hor, ver;
int n, min_x, max_x, min_y, max_y;
bool mrk[N][N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("in.txt","r",stdin);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++){
hr[i][j] = vr[i][j] = MP(oo, -oo);
}
cin >> n;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |