# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877794 | Alora | Naboj (COCI22_naboj) | C++17 | 190 ms | 28244 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 Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 300005
const int M = 1e9 + 7;
using namespace std;
int n, m, sl, cnt[maxn][4], dem;
pii ans[maxn];
queue <int> q;
vector <int> g[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
if(fopen(Alora".inp", "r")){
freopen(Alora".inp", "r", stdin);
freopen(Alora".out", "w", stdout);}
cin >> n >> m;
fi(i, 1, m){
int u, v; cin >> u >> v;
g[u].pb(v); cnt[u][1]++;
g[v].pb(u); cnt[v][0]++;
}
fi(u, 1, n) if(cnt[u][1] == 0 || cnt[u][0] == 0) q.push(u);
while(q.size()){
int u = q.front(); q.pop();
dem++;
if(cnt[u][1] + cnt[u][0] == 0) continue;
int t = (cnt[u][0] > 0 ? 0 : 1);
cnt[u][t] = 0;
//cout << u << " " << t << endl;
ans[++sl] = {u, t};
for(auto v: g[u]) if(cnt[v][1 - t]){
cnt[v][1 - t]--;
if(cnt[v][1 - t] == 0) q.push(v);
}
}
if(dem < n) {cout << -1; return 0;}
cout << sl << '\n';
fid(i, sl, 1) cout << ans[i].f << " " << ans[i].se << '\n';
return 0;
}
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... |