Submission #1008604

#TimeUsernameProblemLanguageResultExecution timeMemory
1008604MalixFountain Parks (IOI21_parks)C++17
0 / 100
0 ms352 KiB
#include "parks.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> tii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define MP make_pair #define LSOne(s) ((s)&(-s)) ll INF=1e18+10; int inf=1e9+10; ll M=1e9+7; int construct_roads(std::vector<int> x, std::vector<int> y) { int n=x.size(); pii a; REP(i,0,n)a.PB({y[i],i}); sort(a.begin(),a.end()); vii ans(4); REP(i,0,n-1){ if(a[i].F+2!=a[i+1].F)return 0; ans[0].PB(a[i].S); ans[1].PB(a[i+1].S); ans[2].PB(a[i].F+1); ans[3].PB(3); } build(ans[0],ans[1],ans[2],ans[3]); 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...