oj.uz

답안 #49386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49386 2018-05-28T07:11:58 Z imeimi2000 철로 (IOI14_rail) C++17
100 / 100
 127 ms 892 KB 
#include "rail.h"
#include <vector>
#include <algorithm>

using namespace std;

const int MAXN = 5000;
int n;
int d0[MAXN];
int d1[MAXN];
int rd[MAXN];
int st[MAXN];
int *l, *t;

void calc(vector<int> &ps, int s) {
    sort(ps.begin(), ps.end(), [&](int i, int j) { return rd[i] < rd[j]; });
    int tp = 0;
    l[ps[0]] = l[s] + rd[ps[0]];
    t[ps[0]] = 2;
    int mx = ps[0];
    st[tp++] = l[mx] << 1;
    for (int i = 1; i < ps.size(); ++i) {
        int fn = (l[mx] << 1) + rd[ps[i]] - rd[mx] - getDistance(ps[i], mx);
        if (find(st, st + tp, fn) - st != tp) {
            l[ps[i]] = fn - rd[ps[i]] - l[s];
            t[ps[i]] = 1;
        }
        else {
            l[ps[i]] = l[s] + rd[ps[i]];
            t[ps[i]] = 2;
            st[tp++] = l[ps[i]] << 1;
            mx = ps[i];
        }
    }
}

void findLocation(int N, int f, int _l[], int _t[]) {
    n = N;
    l = _l;
    t = _t;
    
    int mn = 1;
    for (int i = 1; i < n; ++i) {
        d0[i] = getDistance(0, i);
        if (d0[i] < d0[mn]) mn = i;
    }
    d1[0] = d0[mn];
    vector<int> vt1, vt2;
    rd[0] = rd[mn] = d1[0];
    vt1.push_back(0);
    vt2.push_back(mn);
    for (int i = 1; i < n; ++i) {
        if (mn == i) continue;
        d1[i] = getDistance(mn, i);
        if (d0[i] == d1[i] + d1[0]) vt1.push_back(i), rd[i] = d1[i];
        else vt2.push_back(i), rd[i] = d0[i];
    }
    l[0] = f;
    t[0] = 1;
    calc(vt2, 0);
    l[mn] = -(f + d1[0]);
    t[mn] = 1;
    calc(vt1, mn);
    l[mn] = -l[mn];
    t[mn] = 2;
    for (int i : vt1) {
        l[i] = -l[i];
        t[i] ^= 3;
    }
}

Compilation message

rail.cpp: In function 'void calc(std::vector<int>&, int)':
rail.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < ps.size(); ++i) {
                     ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 820 KB Output is correct
2 Correct 108 ms 820 KB Output is correct
3 Correct 85 ms 828 KB Output is correct
4 Correct 89 ms 828 KB Output is correct
5 Correct 90 ms 828 KB Output is correct
6 Correct 101 ms 832 KB Output is correct
7 Correct 99 ms 892 KB Output is correct
8 Correct 92 ms 892 KB Output is correct
9 Correct 113 ms 892 KB Output is correct
10 Correct 98 ms 892 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 892 KB Output is correct
2 Correct 91 ms 892 KB Output is correct
3 Correct 114 ms 892 KB Output is correct
4 Correct 89 ms 892 KB Output is correct
5 Correct 93 ms 892 KB Output is correct
6 Correct 92 ms 892 KB Output is correct
7 Correct 96 ms 892 KB Output is correct
8 Correct 96 ms 892 KB Output is correct
9 Correct 100 ms 892 KB Output is correct
10 Correct 127 ms 892 KB Output is correct
11 Correct 104 ms 892 KB Output is correct
12 Correct 97 ms 892 KB Output is correct
13 Correct 95 ms 892 KB Output is correct
14 Correct 99 ms 892 KB Output is correct
15 Correct 92 ms 892 KB Output is correct
16 Correct 94 ms 892 KB Output is correct
17 Correct 94 ms 892 KB Output is correct
18 Correct 85 ms 892 KB Output is correct
19 Correct 100 ms 892 KB Output is correct
20 Correct 113 ms 892 KB Output is correct