# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100285 | Ort | Konj (COCI19_konj) | C++11 | 167 ms | 27020 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<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cctype>
#include<tuple>
#define MAX 310
using namespace std;
char horse[MAX][MAX];
vector<tuple<int,int,int,int> > mat[MAX][MAX];
vector<pair<int,int> > points;
vector<int> visited[MAX][MAX];
int n, si, sj, a, b, c, d, e, f, g, h;
int maxi, maxj;
void load() {
int ai, bi, ci, di;
for(int i=0;i<n;i++) {
cin >> ai >> bi >> ci >> di;
mat[bi][ai].push_back(make_tuple(di,ci,bi,ai));
mat[di][ci].push_back(make_tuple(bi,ai,di,ci));
visited[bi][ai].push_back(0);
visited[di][ci].push_back(0);
}
cin >> si>> sj;
int u=sj, d=sj, l=si, r=si;
bool found = 0;
while(r<=300 && mat[sj][r].size()==0) r++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |