제출 #886043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
886043		VMaksimoski008	경주 (Race) (IOI11_race)	C++14	0 / 100	1 ms	2396 KiB

race

#include <bits/stdc++.h>
#include "race.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int ans = 1e9;

int best_path(int N, int K, int H[][2], int L[]) {
    if(ans == 1e9) return -1;
    return ans;
}

// int32_t main() {
//     setIO();

//     int n, k;
//     cin >> n >> k;

//     int graph[n-1][2];
//     for(int i=0; i<n-1; i++) {
//         int a, b;
//         cin >> a >> b;
//         graph[i][0] = a;
//         graph[i][1] = b;
//     }

//     int len[n-1];
//     for(int i=0; i<n-1; i++) cin >> len[i];

//     cout << best_path(n, k, graph, len) << '\n';
//     return 0;
// }

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57