제출 #673074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673074		1bin	철로 (IOI14_rail)	C++17	0 / 100	71 ms	588 KiB

rail

#include <bits/stdc++.h>
#include "rail.h"

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;

void findLocation(int n, int fi, int location[], int stype[]){
    vector<pair<int, int>> v;
    for(int i = 1; i < n; i++){
        int d = getDistance(0, i);
        v.emplace_back(d, i);
    }
    sort(all(v));
    location[0] = fi; stype[0] = 1;
    if(n == 1) return;
    
    auto [d0, x] = v[0];
    location[x] = fi + d0; stype[x] = 2;
    int l, r, dr, dl;
    l = 0, r = x, dl = d0 * 2, dr = d0;
    for(int i = 1; i < n - 1; i++){
        auto&[d, x] = v[i];
        cout << "cur is : " << l << ' ' << r << ' ' << x << '\n';
        int d1 = getDistance(1, x);
        if(d0 + d1 == d){
            int xl = getDistance(l, x);
            if(d == dl + xl){
                location[x] = location[l] + xl;
                stype[x] = 2;
            }
            else{
                location[x] = fi + 2 * d0 - d;
                stype[x] = 1;
                if(location[x] < fi) l = x, dl = d;
            }
        }
        else{
            int xr = getDistance(r, x);
            if(d == dr + xr){
                location[x] = fi + dr - xr;
                stype[x] = 1;
            }
            else{
                location[x] = fi + d;
                stype[x] = 2;
                r = x; dr = d;
            }
        }
    }
    return;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44