제출 #1307364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307364		opeleklanos	분수 공원 (IOI21_parks)	C++20	0 / 100	11 ms	2724 KiB

parks

#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(1);
        benchY.push_back(yl[i].first+1);
    }
    build(roadU, roadD, benchX, benchY);
    return 1;
}

// int main(void){
//     freopen("input.txt", "r", stdin);
//     ll ni;
//     cin>>ni
//     vector<int> c1(ni), l1(qu), r1(qu), v1(qu);
//     for(ll i = 0; i<ni; i++) cin>>c1[i];
//     for(ll i = 0; i<qu; i++) cin>>l1[i];
//     for(ll i = 0; i<qu; i++) cin>>r1[i];
//     for(ll i = 0; i<qu; i++) cin>>v1[i];
//     vector<int> ans = construct_roads(c1, l1, r1, v1);
//     for(auto i : ans) cout<<i<<endl;
// }

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30