제출 #1211902

#제출 시각아이디문제언어결과실행 시간메모리
1211902LIARail (IOI14_rail)C++17
8 / 100
31 ms584 KiB
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;

void findLocation(int n, int first, int location[], int stype[]){
  stype[0] = 1;
  loop(i,1,n) stype[i] = 2;
  loop(i,1,n){
    ll d = getDistance(0, i);
    location[i] = first + d;
  }
  location[0] = first;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...