제출 #767959

#제출 시각아이디문제언어결과실행 시간메모리
767959MinaRagy06철로 (IOI14_rail)C++17
8 / 100
47 ms496 KiB
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;
typedef int64_t ll;

#ifdef MINA
int getDistance(int i, int j) {
    cout << i << ' ' << j << endl;
    int x;
    cin >> x;
    return x;
}
#endif
void findLocation(int n, int first, int location[], int stype[]) {
    location[0] = first, stype[0] = 1;
    if (n == 1) return;
    for (int i = 1; i < n; i++) {
        int x = getDistance(0, i), x2 = getDistance(i, 0);
        assert(x > 0), assert(x2 > 0);
        if (x2 == x) {
            location[i] = first + x;
            stype[i] = 2;
        } else {
            assert(x2 < x);
            location[i] = first - x2;
            stype[i] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        assert(location[i] > 0);
        assert(stype[i] == 1 || stype[i] == 2);
        if (stype[i] == 2) assert(location[i] > first);
        if (stype[i] == 1) assert(location[i] <= 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...