Submission #1263010

#TimeUsernameProblemLanguageResultExecution timeMemory
1263010vtnooWorld Map (IOI25_worldmap)C++20
7 / 100
151 ms18388 KiB
#include <bits/stdc++.h> using namespace std; const int K=240; vector<vector<int>> g; std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B){ g.resize(0); g.resize(K, vector<int> (K, -1)); vector<pair<int,int>> ed; for(int i=0;i<M;i++){ if(A[i]!=1&&B[i]!=1){ ed.push_back({A[i], B[i]}); } } int cur=0; for(int i=0;i<K;i+=2){ g[i][0]=(cur%N)+1; cur++; } int e=0; for(int j=2;j<K;j++){ for(int i=0;i<K&&e<(int)ed.size();i+=3){ g[i][j]=ed[e].first; g[i+1][j]=ed[e].second; e++; } } for(int i=0;i<K;i++){ for(int j=0;j<K;j++){ if(g[i][j]==-1){ g[i][j]=1; } } } return g; }
#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...