| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 436761 | PiejanVDC | 분수 공원 (IOI21_parks) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
int construct_roads(vector<int>x, vector<int> y) {
vector<pair<int,int>>two,four,six;
for(int i = 0 ; i < y.size() ; i++) {
if(x[i] == 2) two.push_back({y[i],i});
else if(x[i] == 4) four.push_back({y[i],i});
else six.push_back({y[i],i});
}
vector<int>adj[x.size()];
vector<int>u,v,a,b;
sort(two.begin(),two.end());
sort(four.begin(),four.end());
sort(six.begin(),six.end());
for(int i = 0 ; i < (int)two.size()-1 ; i++) {
if(two[i+1].first-two[i].first == 2) {
u.push_back(two[i].second);
v.push_back(two[i+1].second);
a.push_back(1);
b.push_back(two[i].first+1);
adj[two[i].second].push_back(two[i+1].second);
adj[two[i+1].second].push_back(two[i].second);
}
}
for(int i = 0 ; i < (int)four.size()-1 ; i++) {
if(four[i+1].first-four[i].first == 2) {
u.push_back(four[i].second);
v.push_back(four[i+1].second);
a.push_back(5);
b.push_back(four[i].first+1);
adj[four[i].second].push_back(four[i+1].second);
adj[four[i+1].second].push_back(four[i].second);
}
}
for(int i = 0 ; i < (int)six.size()-1 ; i++) {
if(six[i+1].first-six[i].first == 2) {
u.push_back(six[i].second);
v.push_back(six[i+1].second);
a.push_back(7);
b.push_back(six[i].first+1);
adj[six[i].second].push_back(six[i+1].second);
adj[six[i+1].second].push_back(six[i].second);
}
}
if((int)two.size() > 0 && (int)four.size() > 0) {
for(int i = 0 ; i < two.size() ; i++) {
int left=0,right=four.size()-1;
while(left <= right) {
int mid = (left+right)/2;
if(four[mid].first == two[i].first) {
u.push_back(two[i].second);
v.push_back(four[mid].second);
a.push_back(3);
b.push_back(two[i].first+1);
adj[two[i].second].push_back(four[mid].second);
adj[four[mid].second].push_back(two[i].second);
break;
}
if(four[mid].first < two[i].first) {
left=mid+1;
} else {
right=mid-1;
}
}
}
}
if((int)four.size() > 0 && (int)six.size() > 0) {
bool c = true;
for(int i = 0 ; i < four.size() ; i++) {
c=1-c;
int left=0,right=six.size()-1;
while(left <= right) {
int mid = (left+right)/2;
if(six[mid].first == four[i].first) {
u.push_back(four[i].second);
v.push_back(six[mid].second);
a.push_back(5);
b.push_back(four[i].first+(c?1:-1);
adj[four[i].second].push_back(six[mid].second);
adj[six[mid].second].push_back(four[i].second);
break;
}
if(six[mid].first < four[i].first) {
left=mid+1;
} else {
right=mid-1;
}
}
}
}
stack<int>s;
s.push(0);
vector<bool>vis(x.size(),false);
while(!s.empty()) {
int node = s.top();
s.pop();
vis[node]=true;
for(auto z : adj[node]) {
if(!vis[z]) s.push(z);
}
}
bool f=true;
for(auto z : vis) {
if(!z) {
f=false; break;
}
}
if(f) {
build(u,v,a,b);
return 1;
}
return 0;
}