제출 #204547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204547		awlintqaa	철로 (IOI14_rail)	C++14	30 / 100	84 ms	892 KiB

rail

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "rail.h"
int n,st,en,id;
int dis[2][109];
void findLocation(int N, int first, int location[], int stype[]){
        n=N,st=first;
        location[0]=st,stype[0]=1;
        en=1e9,id=-1;
        for(int i=1;i<n;i++){
                dis[0][i]=getDistance(0,i);
                if(dis[0][i]<en){
                        en=dis[0][i];
                        id=i;
                }
        }
        dis[1][0]=dis[0][id];
        location[id]=st+en;
        stype[id]=2;
        for(int i=1;i<n;i++){
                if(i==id)C;
                dis[1][i]=getDistance(id,i);
        }
        for(int i=1;i<n;i++){
                if(i==id)C;
                if(dis[0][i] == dis[0][id]+dis[1][i]){
                        location[i]=location[id]-dis[1][i];
                        stype[i]=1;
                }
                else{
                        location[i]=st+dis[0][i];
                        stype[i]=2;
                }
        }
}

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