| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1270929 | nerrrmin | 분수 공원 (IOI21_parks) | C++20 | 39 ms | 8080 KiB |
#include "parks.h"
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
int construct_roads(std::vector<int> x, std::vector<int> y)
{
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
vector < pair < int, int > > g;
int cnt = 0;
for (auto pos: y)
{
g.pb(make_pair(pos, cnt ++));
}
sort(g.begin(), g.end());
for (int i = 0 ;i < g.size(); ++ i)
{
if(i == 0)continue;
if(g[i].first - g[i-1].first != 2)return 0;
}
std::vector<int> u, v, a, b;
for (int i = 0 ;i < g.size(); ++ i)
{
if(i == 0)continue;
u.pb(g[i-1].second);
v.pb(g[i].second);
a.pb(3);
b.pb(g[i].first-1);
}
build(u, v, a, b);
return 1;
}
| # | 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... | ||||
