Submission #970293

#TimeUsernameProblemLanguageResultExecution timeMemory
970293mychecksedadFountain Parks (IOI21_parks)C++17
5 / 100
100 ms18104 KiB
#include "parks.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n'; #define ll long long int const int N = 3e5+10; int construct_roads(std::vector<int> x, std::vector<int> y) { if (x.size() == 1) { build({}, {}, {}, {}); return 1; } int n = x.size(); vector<int> u, v, a, b; vector<pair<int, int>> F; for(int i = 0; i < n; ++i) F.pb({y[i], i}); sort(all(F)); for(int i = 0; i < n - 1; ++i){ if(F[i + 1].first - F[i].first > 2){ return 0; } u.pb(F[i].second); v.pb(F[i + 1].second); a.pb(1); b.pb(F[i].first+F[i+1].first>>1); } build(u, v, a, b); return 1; }

Compilation message (stderr)

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:30:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |         b.pb(F[i].first+F[i+1].first>>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...