# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045467 | moonrabbit2 | Parking (CEOI22_parking) | C++17 | 332 ms | 42348 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
using pii=array<int,2>;
const int N=200005;
int n,m,b[N],t[N];
vector<int> g[N],up[N],l[N];
bool vis[N];
vector<int> V,e;
bool ok=true,isCyc;
int outcnt;
vector<pii> ans;
vector<vector<int>> cycles;
void fail(){
cout<<"-1\n";
exit(0);
}
void upd(int i){
vector<int> nl;
for(int c: l[i]) if(b[c]==i||t[c]==i) nl.push_back(c);
sort(nl.begin(),nl.end());
nl.resize(unique(nl.begin(),nl.end())-nl.begin());
for(int c: l[i]) if(b[c]==t[c]) nl.push_back(c);
l[i]=nl;
up[i].clear();
for(int c: l[i]) if(b[c]==i&&t[c]) up[i].push_back(t[c]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |