Submission #1081936

#TimeUsernameProblemLanguageResultExecution timeMemory
1081936ALeonidouFountain Parks (IOI21_parks)C++17
0 / 100
1 ms348 KiB
#include "parks.h" #include <bits/stdc++.h> using namespace std; #define ll int #define F first #define S second #define pb push_back #define sz(x) (ll)x.size() typedef vector <ll> vi; typedef pair <ll,ll> ii; typedef vector <ii> vii; #define dbg(x) cout<<#x<<": "<<x<<endl; #define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl; #define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl; void printVct(vi &v){ for (ll i =0; i<sz(v); i++){ cout<<v[i]<<" "; } cout<<endl; } int construct_roads(vi x, vi y) { ll n = sz(x); sort(y.begin(), y.end()); vi u,v,a,b; for (ll i= 0; i<n-1; i++){ if (y[i] != y[i+1] - 2){ return 0; } u.pb(y[i]); v.pb(y[i+1]); a.pb(1); b.pb(y[i]+1); } build(u, v, a, b); 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...