Submission #1262999

#TimeUsernameProblemLanguageResultExecution timeMemory
1262999vtnooWorld Map (IOI25_worldmap)C++20
0 / 100
154 ms18396 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]}); } } for(int i=0;i<=2;i+=2){ g[i][0]=1; } for(int i=0;i<K;i++){ g[i][1]=(i%N)+1; } int j=3; for(auto [a, b]:ed){ g[0][j]=a; g[1][j]=b; j+=2; } 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...