oj.uz

Submission #973989

# Submission time Handle Problem Language Result Execution time Memory
973989 2024-05-02T14:24:28 Z steveonalex Amusement Park (JOI17_amusement_park) C++17
70 / 100
 32 ms 9948 KB 
#include <bits/stdc++.h>
#include "Joi.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }
 
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


// void MessageBoard(int i, int j){cout << j << ",";}

struct DSU{
    int n;
    vector<int> parent;

    DSU(int _n){
        n = _n;
        parent.resize(n);
        for(int i = 0; i<n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}
    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            parent[v] = u;
            return true;
        }
        return false;
    }
};

const int N = 1e4 + 69;
vector<int> graph[N];
vector<int> ver[N];
int color[N];
int untouched_cnt;

void dfs(int u, int p){
    ver[u].push_back(u);
    for(int v: graph[u]) if (v != p){
        dfs(v, u);
        for(int i: ver[v]) ver[u].push_back(i);
        ver[v].clear();
    }
    if (ver[u].size() >= 60 && (untouched_cnt - ver[u].size() >= 60 || u == p)){
        untouched_cnt -= ver[u].size();
        for(int i = 0; i< ver[u].size(); ++i){
            color[ver[u][i]] = i % 60;
        }
        ver[u].clear();
    }
}


void Joi(int n, int m, int A[], int B[], ll X, int T) {
    vector<pair<int, int>> edging(m);
    for(int i = 0; i<m; ++i){
        edging[i] = {A[i], B[i]};
        if (edging[i].first > edging[i].second) swap(edging[i].first, edging[i].second); 
    }
    sort(ALL(edging));
    shuffle(ALL(edging), rng);

    DSU mst(n);
    for(pair<int, int> i: edging){
        if (mst.join_set(i.first, i.second)){
            int u = i.first, v = i.second;
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
    }

    untouched_cnt = n;
    dfs(0, 0);

    for(int i = 0; i<n; ++i) {
        MessageBoard(i, GETBIT(X, color[i]));
    }
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n = 150, m = 149;
//     int A[m], B[m];
//     for(int i = 0; i<m; ++i) {
//         A[i] = i;
//         B[i] = i + 1;
//     }

//     Joi(n, m, A, B, 69, 1);
 
//     return 0;
// }
#include <bits/stdc++.h>
#include "Ioi.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }
 
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int INF = 1e9 + 69;
// int tape[] = {1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};


// int Move(int v){
//     return tape[v];
// }

struct DSU{
    int n;
    vector<int> parent;

    DSU(int _n){
        n = _n;
        parent.resize(n);
        for(int i = 0; i<n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}
    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            parent[v] = u;
            return true;
        }
        return false;
    }
};

const int N = 1e4 + 69;
vector<int> graph[N];
vector<int> ver[N], shit[N];
int color[N];
int untouched_cnt;

void dfs(int u, int p){
    ver[u].push_back(u);
    for(int v: graph[u]) if (v != p){
        dfs(v, u);
        for(int i: ver[v]) ver[u].push_back(i);
        ver[v].clear();
    }
    if (ver[u].size() >= 60 && (untouched_cnt - ver[u].size() >= 60 || u == p)){
        untouched_cnt -= ver[u].size();
        for(int i = 0; i< ver[u].size(); ++i){
            color[ver[u][i]] = i % 60;
        }
        shit[u] = ver[u];
        ver[u].clear();
    }
}

bool dp[N];
bool bit[60];

void go(int u, int p, int &cnt){
    for(int v: graph[u]) if (v != p){
        go(v, u, cnt);
        if (dp[v]) {
            dp[u] = 1;
            cnt++;
        }
    }
}


void bobby(int u, int p){
    for(int v: graph[u]) if (v != p && dp[v]){
        bit[color[v]] = Move(v);
        bobby(v, u);
    }
    if (u != p) Move(p);
}


ll Ioi(int n, int m, int A[], int B[], int P, int V, int T) {
    vector<pair<int, int>> edging(m);
    for(int i = 0; i<m; ++i){
        edging[i] = {A[i], B[i]};
        if (edging[i].first > edging[i].second) swap(edging[i].first, edging[i].second); 
    }
    sort(ALL(edging));
    shuffle(ALL(edging), rng);

    DSU mst(n);
    for(pair<int, int> i: edging){
        if (mst.join_set(i.first, i.second)){
            int u = i.first, v = i.second;
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
    }

    untouched_cnt = n;
    dfs(0, 0);

    bit[color[P]] = V;
    for(int i = 0; i<n; ++i) {
        int pos = -1;
        for(int j = 0; j < shit[i].size(); ++j) if (shit[i][j] == P) pos = j;

        if (pos == -1) continue;
        pair<int, int> best = {INF, INF};

        for(int j = 0; j + 59 < shit[i].size();++j)if (j <= pos && pos <= j + 59){
            memset(dp, 0, sizeof dp);
            for(int k = j; k <= j+59; ++k) dp[shit[i][k]] = 1;

            int edge_cnt = 0;
            go(P, P, edge_cnt);

            minimize(best, make_pair(edge_cnt, j));
        }
        int edge_cnt = 0;
        for(int k = best.second; k <= best.second+59; ++k) dp[shit[i][k]] = 1;
        go(P, P, edge_cnt);
        bobby(P, P);

        break;
    }

    ll X = 0;
    for(int i = 0; i<60; ++i) if (bit[i]) X += MASK(i);

    return X;
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n = 150, m = 149;
//     int A[m], B[m];
//     for(int i = 0; i<m; ++i) {
//         A[i] = i;
//         B[i] = i + 1;
//     }

//     cout << Ioi(n, m, A, B, 69, tape[69], 1) << "\n";
 
 
//     return 0;
// }

Compilation message

Joi.cpp: In function 'void dfs(int, int)':
Joi.cpp:90:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |         for(int i = 0; i< ver[u].size(); ++i){
      |                        ~^~~~~~~~~~~~~~~

Ioi.cpp: In function 'void dfs(int, int)':
Ioi.cpp:95:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for(int i = 0; i< ver[u].size(); ++i){
      |                        ~^~~~~~~~~~~~~~~
Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:150:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |         for(int j = 0; j < shit[i].size(); ++j) if (shit[i][j] == P) pos = j;
      |                        ~~^~~~~~~~~~~~~~~~
Ioi.cpp:155:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |         for(int j = 0; j + 59 < shit[i].size();++j)if (j <= pos && pos <= j + 59){
      |                        ~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2076 KB Output is correct
2 Correct 2 ms 2076 KB Output is correct
3 Correct 2 ms 2068 KB Output is correct
4 Correct 2 ms 2076 KB Output is correct
5 Correct 2 ms 2060 KB Output is correct
6 Correct 2 ms 2064 KB Output is correct
7 Correct 2 ms 2080 KB Output is correct
8 Correct 2 ms 2068 KB Output is correct
9 Correct 2 ms 2072 KB Output is correct
10 Correct 2 ms 2076 KB Output is correct
11 Correct 5 ms 2124 KB Output is correct
12 Correct 2 ms 2060 KB Output is correct
13 Correct 2 ms 2072 KB Output is correct
14 Correct 2 ms 2584 KB Output is correct
15 Correct 2 ms 2072 KB Output is correct
16 Correct 2 ms 2320 KB Output is correct
17 Correct 2 ms 2072 KB Output is correct
18 Correct 2 ms 2080 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5580 KB Output is correct
2 Correct 23 ms 5584 KB Output is correct
3 Correct 24 ms 5532 KB Output is correct
4 Correct 20 ms 4616 KB Output is correct
5 Correct 19 ms 8416 KB Output is correct
6 Correct 30 ms 6600 KB Output is correct
7 Correct 17 ms 6372 KB Output is correct
8 Correct 16 ms 6360 KB Output is correct
9 Correct 17 ms 6632 KB Output is correct
10 Correct 13 ms 4576 KB Output is correct
11 Correct 17 ms 4576 KB Output is correct
12 Correct 13 ms 4228 KB Output is correct
13 Correct 19 ms 4428 KB Output is correct
14 Correct 13 ms 4568 KB Output is correct
15 Correct 30 ms 5084 KB Output is correct
16 Correct 17 ms 5080 KB Output is correct
17 Correct 15 ms 4576 KB Output is correct
18 Correct 27 ms 4576 KB Output is correct
19 Correct 27 ms 4532 KB Output is correct
20 Correct 16 ms 7268 KB Output is correct
21 Correct 13 ms 6884 KB Output is correct
22 Correct 17 ms 6372 KB Output is correct
23 Correct 17 ms 6620 KB Output is correct
24 Correct 16 ms 6628 KB Output is correct
25 Correct 17 ms 6624 KB Output is correct
26 Correct 16 ms 6624 KB Output is correct
27 Correct 17 ms 6704 KB Output is correct
28 Correct 18 ms 6872 KB Output is correct
29 Correct 15 ms 6348 KB Output is correct
30 Correct 16 ms 6332 KB Output is correct
31 Correct 2 ms 2076 KB Output is correct
32 Correct 2 ms 2064 KB Output is correct
33 Correct 2 ms 2064 KB Output is correct
34 Correct 2 ms 2068 KB Output is correct
35 Correct 2 ms 2064 KB Output is correct
36 Correct 2 ms 2072 KB Output is correct
37 Correct 2 ms 2080 KB Output is correct
38 Correct 1 ms 2076 KB Output is correct
39 Correct 1 ms 2060 KB Output is correct
40 Correct 2 ms 2064 KB Output is correct
41 Correct 2 ms 2076 KB Output is correct
42 Correct 1 ms 2068 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2080 KB Output is correct
2 Correct 2 ms 2064 KB Output is correct
3 Correct 2 ms 2080 KB Output is correct
4 Correct 4 ms 3128 KB Output is correct
5 Correct 4 ms 3132 KB Output is correct
6 Correct 4 ms 3128 KB Output is correct
7 Correct 4 ms 3120 KB Output is correct
8 Correct 4 ms 3132 KB Output is correct
9 Correct 23 ms 9264 KB Output is correct
10 Correct 23 ms 9436 KB Output is correct
11 Correct 17 ms 9948 KB Output is correct
12 Correct 2 ms 2064 KB Output is correct
13 Correct 2 ms 2084 KB Output is correct
14 Correct 2 ms 2068 KB Output is correct
15 Correct 2 ms 2076 KB Output is correct

Subtask #4
42.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 24 ms 5568 KB Partially correct
2 Partially correct 32 ms 5596 KB Partially correct
3 Partially correct 26 ms 5484 KB Partially correct
4 Partially correct 20 ms 4564 KB Partially correct
5 Correct 19 ms 8660 KB Output is correct
6 Partially correct 20 ms 6624 KB Partially correct
7 Correct 17 ms 6368 KB Output is correct
8 Correct 17 ms 6108 KB Output is correct
9 Correct 17 ms 6280 KB Output is correct
10 Correct 13 ms 4556 KB Output is correct
11 Partially correct 16 ms 4660 KB Partially correct
12 Partially correct 13 ms 4304 KB Partially correct
13 Partially correct 14 ms 4304 KB Partially correct
14 Partially correct 13 ms 4572 KB Partially correct
15 Partially correct 30 ms 5596 KB Partially correct
16 Partially correct 16 ms 5084 KB Partially correct
17 Correct 15 ms 4576 KB Output is correct
18 Partially correct 27 ms 4568 KB Partially correct
19 Partially correct 19 ms 4568 KB Partially correct
20 Correct 15 ms 7124 KB Output is correct
21 Correct 14 ms 6872 KB Output is correct
22 Correct 17 ms 6636 KB Output is correct
23 Correct 17 ms 6624 KB Output is correct
24 Correct 18 ms 6612 KB Output is correct
25 Correct 17 ms 6636 KB Output is correct
26 Correct 18 ms 6624 KB Output is correct
27 Correct 17 ms 6888 KB Output is correct
28 Correct 16 ms 6620 KB Output is correct
29 Correct 15 ms 6096 KB Output is correct
30 Correct 16 ms 6612 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 5564 KB Output isn't correct
2 Halted 0 ms 0 KB -