# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223412 | tqbfjotld | Matching (COCI20_matching) | C++14 | 2591 ms | 512 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;
#define MAX_N 2005
bool done[MAX_N];
int u[MAX_N],r[MAX_N], l[MAX_N],d[MAX_N];
int connect[MAX_N];
bool toret = false;
int N;
vector<pair<int,pair<int,int> > >c1;
vector<pair<int,pair<int,int> > >c2;
int X[MAX_N],Y[MAX_N];
void iterate(int n){
if (n==N){
printf("DA\n");
for (int x = 0; x<n; x++){
if (connect[x]!=-1){
printf("%d %d\n",x+1,connect[x]+1);
}
}
toret = true;
return;
}
if (u[n]!=-1){
bool can = true;
for (auto x : c2){
if (X[n]<=x.second.second && X[n]>=x.second.first && x.first<=max(Y[n],Y[u[n]]) && x.first>=min(Y[n],Y[u[n]])){
can = false;
break;
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... |