Submission #781240

#TimeUsernameProblemLanguageResultExecution timeMemory
781240NK_Pipes (CEOI15_pipes)C++17
0 / 100
723 ms63764 KiB
// Success consists of going from failure to failure without loss of enthusiasm #include <bits/stdc++.h> using namespace std; #define nl '\n' #define f first #define s second #define mp make_pair #define pb push_back using pi = pair<int, int>; template<class T> using V = vector<T>; const int eax = 12e6+5; const int nax = 1e5+5; int adj[eax]; int nxt[nax], start[nax]; int main() { cin.tie(0)->sync_with_stdio(0); for(int i = 0; i < nax; i++) nxt[i] = start[i] = -1; int N, M; cin >> N >> M; int u, v; for(int e = 0; e < M; e++) { cin >> u >> v; --u, --v; adj[2*e] = v; nxt[2*e] = start[u]; start[u] = 2*e; adj[2*e+1] = u; nxt[2*e+1] = start[v]; start[v] = 2*e+1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...