| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307362 | opeleklanos | 분수 공원 (IOI21_parks) | C++20 | 1 ms | 332 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);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
