Submission #1250100

#TimeUsernameProblemLanguageResultExecution timeMemory
1250100ezzzayWorld Map (IOI25_worldmap)C++20
15 / 100
17 ms2388 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back vector<int>adj[50]; std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) { for(int i=1;i<=N;i++){ adj[i].clear(); } for(int i=0;i<M;i++){ adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]); } vector< vector<int> > v(2*N, vector<int> (2*N)); for(int i=0;i<2*N;i++){ for(int j=0;j<2*N;j++){ v[i][j]=1; } } for(int i=2;i<=N;i++){ for(int j=1;j<2*N;j++){ v[i*2-4][j]=i; } for(int j=0; j<adj[i].size();j++){ v[i*2-4][j*2+2]= adj[i][j]; } } return v; }
#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...