oj.uz

Submission #1030556

# Submission time Handle Problem Language Result Execution time Memory
1030556 2024-07-22T06:50:11 Z _8_8_ Fun Tour (APIO20_fun) C++17
100 / 100
 182 ms 22240 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
int n,q;
int find_cen(){
    vector<pair<int,int>> a;
    for(int i = 1;i < n;i++){
        int s = attractionsBehind(0,i); 
        if(s*2 > n){
            a.emplace_back(s,i);
        }
    }
    if(a.empty()) return 0;
    sort(a.begin(),a.end());
    return a[0].second;
}
const int N = 1e5 + 12;
int val[N],bel[N];
vector<int> createFunTour(int nn, int qq) {
    if(nn == 2){
        return {0,1};
    }
    n = nn;q = qq;
    int c = find_cen();
    array<int,3> ver = {-1,-1,-1};
    array<vector<pair<int,int>>,3> vec;
    for(int i = 0;i < n;i++){
        if(i == c) continue;
        val[i] = hoursRequired(c,i);
        if(val[i] == 1){
            for(int j = 0;j < 3;j++){
                if(ver[j] == -1){
                    ver[j] = i;
                    break;
                }
            }
        }
    }
    vector<int> res;
    for(int i = 0;i < n;i++){
        if(i == c) continue;
        if(val[i] == 1){
            if(i == ver[0]){
                vec[0].push_back({1,i});
            }else if(i == ver[1]){
                bel[i] = 1;
                vec[1].push_back({1,i});
            }else{
                bel[i] = 2;
                vec[2].push_back({1,i});
            }
            continue;
        }
        int _ = -1;
        for(int k = 0;k < 2;k++){
            if(val[i] - 1 == hoursRequired(i,ver[k])){
                _=k;
                break;
            }
        }
        if(_ == -1) _ = 2;
        bel[i] = _;
        vec[_].push_back({val[i],i});
    }
    int lst = -1;
    int l = 0;
    bool OK = true;
    int _x = (int)vec[0].size(),_y = (int)vec[1].size(),_z = (int)vec[2].size();
    if(true){
        vector<pair<int,int>> cc;
        for(int i = 0;i < 3;i++){
            cc.push_back({(int)vec[i].size(),i});
        }
        sort(cc.begin(),cc.end());
        vec[(int)cc[0].second].push_back({0,c});
    }
    for(int i = 0;i < 3;i++){
        sort(vec[i].begin(),vec[i].end());
    }
    while(true){
        int _x = (int)vec[0].size(),_y = (int)vec[1].size(),_z = (int)vec[2].size();
        if(_x == _y + _z || _y == _x + _z || _z == _x + _y){
            break;
        }
        pair<int,int> mx = {-1,-1};
        int id = -1;
        auto upd = [&](vector<pair<int,int>> &a,int j){
            if(j != lst && (int)a.size()){
                pair<int,int> nv = make_pair(a.back().first,(int)a.size());
                if(nv > mx){
                    mx = nv;
                    id = j;
                }
            }
        };
        auto del = [&](vector<pair<int,int>> &x){ 
            res.push_back(x.back().second);
            x.pop_back();
        };
        int cc = 0;
        for(int i = 0;i < 3;i++){
            upd(vec[i],i);
        }
        lst = id;
        del(vec[id]);
    }
    vector<int> X,Y;
    vector<pair<int,int>> bff;
    int F = 0;
    for(int i = 0;i < 3;i++){
        bff.push_back({(int)vec[i].size(),i});
        if((int)vec[i].size()){
            F = max(F,vec[i].back().first);
        }
    }
    sort(bff.begin(),bff.end());
    bool ok = false;
    for(int i = 0;i < 3;i++){
        int j = bff[i].second;
        if(i < 2){
            if(lst == j) ok = 1;
            for(auto f:vec[j]){
                X.push_back(f.second);
            }
        }else{
            for(auto f:vec[j]){
                Y.push_back(f.second);
            }
        }
    }
    auto cmp = [&](int x,int y)->bool{
        return val[x] > val[y];
    };
    assert((int)X.size() == (int)Y.size());
    sort(X.begin(),X.end(),cmp);
    sort(Y.begin(),Y.end(),cmp);
    if(X.empty()) return res;
    if(ok){
        X.swap(Y);
    }
    if(bel[Y[0]] != lst && val[Y[0]] > val[X[0]]){
        X.swap(Y);
    }
    for(int i = 0;i < (int)X.size();i++){
        res.push_back(X[i]);
        res.push_back(Y[i]);
    }
    return res;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:100:13: warning: unused variable 'cc' [-Wunused-variable]
  100 |         int cc = 0;
      |             ^~
fun.cpp:66:9: warning: unused variable 'l' [-Wunused-variable]
   66 |     int l = 0;
      |         ^
fun.cpp:67:10: warning: unused variable 'OK' [-Wunused-variable]
   67 |     bool OK = true;
      |          ^~
fun.cpp:68:9: warning: unused variable '_x' [-Wunused-variable]
   68 |     int _x = (int)vec[0].size(),_y = (int)vec[1].size(),_z = (int)vec[2].size();
      |         ^~
fun.cpp:68:33: warning: unused variable '_y' [-Wunused-variable]
   68 |     int _x = (int)vec[0].size(),_y = (int)vec[1].size(),_z = (int)vec[2].size();
      |                                 ^~
fun.cpp:68:57: warning: unused variable '_z' [-Wunused-variable]
   68 |     int _x = (int)vec[0].size(),_y = (int)vec[1].size(),_z = (int)vec[2].size();
      |                                                         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 85 ms 15948 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 3 ms 1372 KB Output is correct
23 Correct 7 ms 2396 KB Output is correct
24 Correct 10 ms 3164 KB Output is correct
25 Correct 45 ms 9232 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 92 ms 15692 KB Output is correct
16 Correct 101 ms 15568 KB Output is correct
17 Correct 16 ms 3932 KB Output is correct
18 Correct 39 ms 7348 KB Output is correct
19 Correct 63 ms 12500 KB Output is correct
20 Correct 3 ms 860 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 85 ms 15948 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 2 ms 856 KB Output is correct
48 Correct 3 ms 1372 KB Output is correct
49 Correct 7 ms 2396 KB Output is correct
50 Correct 10 ms 3164 KB Output is correct
51 Correct 45 ms 9232 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 6 ms 1884 KB Output is correct
54 Correct 92 ms 15692 KB Output is correct
55 Correct 101 ms 15568 KB Output is correct
56 Correct 16 ms 3932 KB Output is correct
57 Correct 39 ms 7348 KB Output is correct
58 Correct 63 ms 12500 KB Output is correct
59 Correct 3 ms 860 KB Output is correct
60 Correct 105 ms 16268 KB Output is correct
61 Correct 119 ms 18532 KB Output is correct
62 Correct 111 ms 16584 KB Output is correct
63 Correct 120 ms 20508 KB Output is correct
64 Correct 130 ms 19940 KB Output is correct
65 Correct 122 ms 15988 KB Output is correct
66 Correct 140 ms 18124 KB Output is correct
67 Correct 133 ms 19916 KB Output is correct
68 Correct 136 ms 19404 KB Output is correct
69 Correct 165 ms 20448 KB Output is correct
70 Correct 106 ms 16076 KB Output is correct
71 Correct 120 ms 19912 KB Output is correct
72 Correct 131 ms 18380 KB Output is correct
73 Correct 146 ms 20428 KB Output is correct
74 Correct 158 ms 21888 KB Output is correct
75 Correct 109 ms 17600 KB Output is correct
76 Correct 158 ms 21512 KB Output is correct
77 Correct 131 ms 21448 KB Output is correct
78 Correct 113 ms 20680 KB Output is correct
79 Correct 142 ms 21944 KB Output is correct
80 Correct 182 ms 22240 KB Output is correct
81 Correct 112 ms 16840 KB Output is correct
82 Correct 141 ms 17124 KB Output is correct
83 Correct 119 ms 16984 KB Output is correct
84 Correct 56 ms 7436 KB Output is correct