Submission #1307363

#TimeUsernameProblemLanguageResultExecution timeMemory
1307363opeleklanosFountain Parks (IOI21_parks)C++20
0 / 100
1 ms340 KiB
#include <iostream> #include <vector> #include "parks.h" using namespace std; int n; int construct_roads(vector<int> x, vector<int> y){ n = x.size(); vector<pair<int, int>> yl(n); for(int i = 0; i<n; i++){ yl[i] = {y[i], i}; } vector<int> roadU; vector<int> roadD; vector<int> benchX; vector<int> benchY; for(int i = 0; i<n-1; i++){ if(yl[i].first+2 != yl[i+1].first) return 0; roadU.push_back(yl[i].second); roadD.push_back(yl[i+1].second); benchX.push_back(4); benchY.push_back(yl[i].first+1); } build(roadU, roadD, benchX, benchY); return 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...