Submission #704868

#TimeUsernameProblemLanguageResultExecution timeMemory
704868Paul_Liao_1457Naboj (COCI22_naboj)C++17
25 / 110
344 ms524288 KiB
//記得跳題 //#pragma GCC optimize("O4,unroll_loops") //#pragma GCC target("avx2") #include<iostream> #include<array> #include<vector> #include<string> #include<algorithm> #include<set> #include<queue> #include<stack> #include<math.h> #include<map> #include<unordered_map> #include<unordered_set> #include<cstring> #include<iomanip> #include<bitset> #include<tuple> #include<random> #define ll long long #define FOR(i,a,b) for(int i=a;i<b;i++) #define pb push_back #define INF (ll)(2e18) #define F first #define S second #define endl "\n" #define AC ios::sync_with_stdio(0); using namespace std; vector<pair<int, int> > e[200005]; vector<pair<int, int> > ans; void dfs(int now, int f,int up){ if (up != -1) { ans.pb({now, up}); } for (auto i:e[now]) if (i.F != f) { dfs(i.F, now, i.S); } } signed main(){ AC; int n, m; cin >> n >> m; FOR (i, 0, m) { int a, b; cin >> a >> b; e[a].pb({b, 0}); e[b].pb({a, 1}); } dfs(1, 0, -1); cout << ans.size() << endl; for (auto i:ans) { cout << i.F << " " << i.S << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...