oj.uz

답안 #565252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565252 2022-05-20T14:26:54 Z ngpin04 즐거운 행로 (APIO20_fun) C++14
100 / 100
 253 ms 21444 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#include "fun.h"
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
  if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
  if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
  return l + rd() % (r - l + 1);
}
const int Nmax = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

#define asksz attractionsBehind
#define askdis hoursRequired

vector <int> s[10];

int comp[Nmax];
int sz[Nmax];
int d[Nmax];
int n,q;

vector<int> createFunTour(int N, int Q) {
    n = N;
    q = Q;

    if (n == 2) 
        return vector <int> {0, 1};

    int cen = 0;
    int minsz = n;
    for (int i = 1; i < n; i++) {
        sz[i] = asksz(0, i);
        if (2 * sz[i] >= n) {
            if (mini(minsz, sz[i]))
                cen = i;
        }
    }   
            
    vector <int> cand;
    for (int i = 0; i < n; i++) {
        d[i] = askdis(cen, i);
        if (d[i] == 1) 
            cand.push_back(i);
    }
    assert(cand.size() > 1);

    for (int i = 0; i < n; i++) if (i != cen) {
        int comp = 2;
        for (int j = 0; j < 2; j++)
            if (askdis(cand[j], i) + 1 == d[i])
                comp = j;
        s[comp].push_back(i);
    }

    for (int i = 0; i < 3; i++) {
        sort(ALL(s[i]), [](int i, int j) {
            return d[i] < d[j];
        });
        // for (int x : s[i])
        //     cerr << x << " ";
        // cerr << "\n";
    }

    vector <int> res;

    if (cand.size() == 3) {

        bool rep = true;
        for (int i = 0; i < 3; i++)
        for (int j = i + 1; j < 3; j++) 
            if (s[i].size() > s[j].size()) 
                swap(s[i], s[j]);

        if ((int) s[2].size() == (n >> 1)) 
            rep = false;

        int las = -1;
        while (rep) {
            for (int i = 0; i < 3; i++)
            for (int j = i + 1; j < 3; j++) {
                if (s[i].size() > s[j].size()) {
                    swap(s[i], s[j]);
                    if (las == i || las == j)
                        las ^= i ^ j;
                }
            }

            if (s[0].size() + s[1].size() == s[2].size())
                break;
            int maxd = -1;
            int mx = -1;

            for (int i = 0; i < 3; i++) if (i != las && s[i].size()) {
                if (maxi(maxd, d[s[i].back()]))
                    mx = i;
            }
            
            assert(mx >= 0);
            res.push_back(s[mx].back());
            las = mx;
            // cerr << mx << " " << s[mx].back() << "\n";
            s[mx].pop_back();
        }

        if (las != -1 && las != 2) {
            if (s[las ^ 1].size()) {
                int a = d[res.back()];
                int b = d[s[las ^ 1].back()];
                int c = d[s[2].back()];
                int mx = max({a, b, c});

                if (a < b && b == mx) { 
                    res.push_back(s[las ^ 1].back());
                    s[las ^ 1].pop_back();
                    res.push_back(s[2].back());
                    s[2].pop_back();
                    las = 2;
                }
            }
        }

        for (int x : s[1])
            s[0].push_back(x);
        sort(ALL(s[0]), [](int i, int j) {
            return d[i] < d[j];
        });
        s[1] = s[2];

        if (las != 2) 
            swap(s[0], s[1]);
    }

    if (s[0].size() > s[1].size())
        swap(s[0], s[1]);

    if (s[1].size() > s[0].size()) {
        res.push_back(s[1].back()); 
        s[1].pop_back();
    }

    while (s[0].size()) {
        for (int i = 0; i < 2; i++) {
            res.push_back(s[i].back());
            s[i].pop_back();
        }
    }

    res.push_back(cen);

    return res;
}


//#include "grader.cpp"

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 109 ms 15388 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 5 ms 1188 KB Output is correct
23 Correct 10 ms 2132 KB Output is correct
24 Correct 14 ms 2892 KB Output is correct
25 Correct 63 ms 8924 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 8 ms 1620 KB Output is correct
15 Correct 123 ms 15320 KB Output is correct
16 Correct 130 ms 15064 KB Output is correct
17 Correct 20 ms 3796 KB Output is correct
18 Correct 56 ms 7232 KB Output is correct
19 Correct 90 ms 12112 KB Output is correct
20 Correct 4 ms 852 KB Output is correct

Subtask #5
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 109 ms 15388 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 3 ms 596 KB Output is correct
48 Correct 5 ms 1188 KB Output is correct
49 Correct 10 ms 2132 KB Output is correct
50 Correct 14 ms 2892 KB Output is correct
51 Correct 63 ms 8924 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 8 ms 1620 KB Output is correct
54 Correct 123 ms 15320 KB Output is correct
55 Correct 130 ms 15064 KB Output is correct
56 Correct 20 ms 3796 KB Output is correct
57 Correct 56 ms 7232 KB Output is correct
58 Correct 90 ms 12112 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 154 ms 15300 KB Output is correct
61 Correct 189 ms 17796 KB Output is correct
62 Correct 159 ms 15544 KB Output is correct
63 Correct 166 ms 19288 KB Output is correct
64 Correct 181 ms 19400 KB Output is correct
65 Correct 170 ms 15436 KB Output is correct
66 Correct 186 ms 18024 KB Output is correct
67 Correct 171 ms 19652 KB Output is correct
68 Correct 185 ms 18816 KB Output is correct
69 Correct 238 ms 20312 KB Output is correct
70 Correct 141 ms 15436 KB Output is correct
71 Correct 161 ms 19268 KB Output is correct
72 Correct 176 ms 18280 KB Output is correct
73 Correct 181 ms 18716 KB Output is correct
74 Correct 253 ms 20172 KB Output is correct
75 Correct 162 ms 15556 KB Output is correct
76 Correct 172 ms 19396 KB Output is correct
77 Correct 193 ms 19528 KB Output is correct
78 Correct 169 ms 19828 KB Output is correct
79 Correct 202 ms 21148 KB Output is correct
80 Correct 213 ms 21444 KB Output is correct
81 Correct 153 ms 16456 KB Output is correct
82 Correct 163 ms 16588 KB Output is correct
83 Correct 170 ms 16736 KB Output is correct
84 Correct 61 ms 7136 KB Output is correct