Submission #1302479

#TimeUsernameProblemLanguageResultExecution timeMemory
1302479aaaaaaaaWorld Map (IOI25_worldmap)C++20
0 / 100
31 ms4608 KiB
#include "worldmap.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) { vector<pair<int, int>> ord; for(int i = 1; i <= N; ++i){ for(int j = 1; j <= N; ++j){ if(i == j) continue; ord.push_back({i, j}); } } vector<vector<int>> ans(max(1, (int) ord.size()), vector<int>(max(1, (int) ord.size()), 1)); for(int i = 0; i < ord.size(); ++i){ ans[i][0] = ord[i].first; ans[i][1] = ord[i].second; for(int j = 2; j < ord.size(); ++j) ans[i][j] = ans[i][j - 1]; } return ans; }
#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...