제출 #1043531

#제출 시각아이디문제언어결과실행 시간메모리
1043531Malix철로 (IOI14_rail)C++14
8 / 100
35 ms604 KiB
#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[])
{
    stype[0]=1;
    REP(i,1,n)stype[i]=2;
    location[0]=m;
    REP(i,1,n){
        int k=getDistance(0,i);
        location[i]=location[0]+k;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...