# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226692 | DavidDamian | Konj (COCI19_konj) | C++11 | 96 ms | 21240 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>
using namespace std;
void Sort(int& a,int& b,int& c,int& d)
{
if(c<a){
swap(a,c);
swap(b,d);
return;
}
else{
if(c==a){
if(d<b){
swap(a,c);
swap(b,d);
}
}
}
}
struct line{
int a,b,c,d;
} A[200005];
int n;
vector<int> bucket[305][305];
int color[200005];
int paint[305][305];
int x,y;
queue<int> Q;
void bfs()
{
while(Q.size()){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |