Submission #263205

#TimeUsernameProblemLanguageResultExecution timeMemory
263205NicolaAbusaad2014Highway Tolls (IOI18_highway)C++14
5 / 100
20 ms640 KiB
#include "highway.h" #include <bits/stdc++.h> using namespace std; map<int,int>m; vector<int>v; void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) { int M = (int)U.size(); vector<int> w(M); for (int i = 0; i < M; ++i) { w[i] = 0; } long long mn=ask(w); w.clear(); for (int j = 0; j < M; ++j) { std::vector<int> w(M); for (int i = 0; i < M; ++i) { w[i] = 0; if(i==j){ w[i]=1; } } long long toll = ask(w); if(toll>mn){ v.push_back(U[j]); v.push_back(V[j]); m[V[j]]++; m[U[j]]++; } } vector<int>ans; for(long i=0;i<(long)v.size();i++){ if(m[v[i]]==1){ ans.push_back(v[i]); } } answer(ans[0], ans[1]); }
#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...