제출 #1043548

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

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

void findLocation(int n, int m, int location[], int stype[])
{
    vi t(n,1),loc(n,-1);
    t[0]=1;loc[0]=m;
    vi b(n,0);
    REP(i,1,n)b[i]=getDistance(0,i)+m;
    int x=inf,p=0;
    REP(i,1,n)if(b[i]<x){
        x=b[i];p=i;
    }
    vi c(n,0);
    REP(i,1,n)if(p!=i)c[i]=getDistance(p,i);
    REP(i,1,n){
        if(c[i]<b[i]&&p!=i){
            loc[i]=m-(c[i]-x);
            t[i]=1;
        }
        else{
            loc[i]=b[i];
            t[i]=2;
        }
    }
    REP(i,0,n)stype[i]=t[i];
    REP(i,0,n)location[i]=loc[i];
}

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