Submission #31549

#TimeUsernameProblemLanguageResultExecution timeMemory
31549YoLoSenior Postmen (BOI14_postmen)C++14
38 / 100
1100 ms22520 KiB
#include<bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back #define fi first #define se second #define endl '\n' #define N 100000 #define pi acos(-1) #define tora acos(-1)/180 #define tode 180/acos(-1) #define pque priority_queue typedef pair < int, int > ii; typedef vector < int > vi; typedef vector < vi > vii; int mod = 1000000007 ; int check[500009], edge[500009], n, m, a, b, cak, x[500009], y[500009]; vi v[500009]; stack<int> st; void dfs(int u) { //cout << u << endl; if(check[u] == 1) { if(cak == 1) printf("\n"); printf("%d", u); while(!st.empty() && st.top() != u) { int id = st.top(); printf(" %d", id); check[id] = 0; st.pop(); if(id == u) break; } cak = 1; } else { check[u] = 1; st.push(u); } for(int i = 0; i < (int)v[u].size(); i++) if(edge[v[u][i]] == 0 && check[u] == 1) { edge[v[u][i]] = 1; if(x[v[u][i]] != u) dfs(x[v[u][i]]); else dfs(y[v[u][i]]); } } int main() { //ios_base::sync_with_stdio(0); cin >> n >> m; for(int i = 1; i <= m; i++) { scanf("%d%d", &x[i], &y[i]); v[x[i]].pb(i); v[y[i]].pb(i); } for(int i = 1; i <= n; i++) dfs(i); }

Compilation message (stderr)

postmen.cpp: In function 'int main()':
postmen.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x[i], &y[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...