Submission #1207328

#TimeUsernameProblemLanguageResultExecution timeMemory
1207328matisitoRail (IOI14_rail)C++20
8 / 100
33 ms584 KiB
#include "rail.h" #include <iostream> #include <iomanip> #include <string> #include <math.h> #include <algorithm> #include <cstring> #include <numeric> #include <vector> #include <bitset> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <unordered_map> #include <unordered_set> using namespace std; const int M=1e6; void findLocation(int N, int first, int location[], int stype[]){ vector<pair<int, int>>der, izq; for(int i=1 ; i<N ; i++){ int a=getDistance(0, i); int b=getDistance(i, 0); if(a==b) der.push_back({a, i}); else izq.push_back({b, i}); } // sort(der.begin(), der.end()); location[0]=first; stype[0]=1; for(pair<int, int> x:izq){ location[x.second]=(first-x.first+M)%M; stype[x.second]=1; } for(pair<int, int> x:der){ location[x.second]=(first+x.first)%M; stype[x.second]=2; } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...