제출 #1041999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041999		ALeonidou	철로 (IOI14_rail)	C++17	8 / 100	35 ms	604 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;

#define ll int
#define F first
#define S second
#define sz(x) (ll)x.size()
#define endl "\n"
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

void findLocation(ll n, ll f, ll pos[], ll type[])
{
    pos[0] = f;
    type[0] = 1;    //c:1, d:2 

    //subtask 1:
    for (ll i =1; i<n; i++){
        ll a = getDistance(0,i);
        ll b = getDistance(i,0);

        if (a == b){
            type[i] = 2;
            pos[i] = f + a;
        }
        else{
            type[i] = 1;
            pos[i] = f - b;
        }
    }
}

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