oj.uz

Submission #967649

# Submission time Handle Problem Language Result Execution time Memory
967649 2024-04-22T15:02:44 Z happy_node Amusement Park (JOI17_amusement_park) C++17
65 / 100
 19 ms 4340 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const int MX=10005;
 
vector<int> adj[MX];
 
int timer=-1;
vector<int> euler;
int sz[MX], par[MX], tin[MX], tout[MX];


struct DSU {
        int par[MX];
 
        int find(int v) {
                return par[v]==v?v:par[v]=find(par[v]);
        }
 
        bool merge(int u, int v) {
                u=find(u),v=find(v);
                if(u==v) return false;
                par[u]=v;
                return true;
        }
 
        void prep(int N) {
                for(int i=0;i<N;i++) par[i]=i;
        }
} DS;
 
void dfs(int v, int p) {
        tin[v]=++timer;
        euler.push_back(v);
        sz[v]=1;
        par[v]=p;
        for(auto u:adj[v]) {
                if(u==p) continue;
                dfs(u,v);
                sz[v]+=sz[u];
        }
        tout[v]=timer;
}
 
void Joi(int N, int M, int A[], int B[], long long X, int T) {
        DS.prep(N);
        
        for(int i=0;i<M;i++) {
                int x=A[i],y=B[i];
                if(DS.merge(x,y)) {
                        adj[x].push_back(y);
                        adj[y].push_back(x);
                }
        }

        dfs(0,-1);
        for(int i=0;i<N;i++) {
                sort(adj[i].begin(),adj[i].end(),[&](int i, int j) {
                        return sz[i]<sz[j];
                });     
        }
        euler.clear();
        timer=-1;
        dfs(0,-1);
 
        for(int i=0;i<N;i++) {
                int k=i%60;
                MessageBoard(euler[i],X>>k&1);
        }
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const int MX=10005;
 
vector<int> adj[MX];
 
int timer=-1;
vector<int> euler;
int sz[MX], par[MX], tin[MX], tout[MX];
 
void dfs(int v, int p) {
        tin[v]=++timer;
        euler.push_back(v);
        sz[v]=1;
        par[v]=p;
        for(auto u:adj[v]) {
                if(u==p) continue;
                dfs(u,v);
                sz[v]+=sz[u];
        }
        tout[v]=timer;
}
 
ll get(int x, int y) {
        return y*(1LL<<(tin[x]%60));
}
 
ll res=0, cnt=0;
 
bool vis[60];
int VIS[60];
 
void dfs0(int v, int p) {
        if(cnt==60) return;
        for(auto u:adj[v]) {
                if(u==p) continue;
                if(VIS[tin[u]%60]==2) continue;
                if(!vis[tin[u]%60]) cnt++;
                VIS[tin[u]%60]++;
                vis[tin[u]%60]=1;
                res|=get(u,Move(u));
                dfs0(u,v);
                if(cnt==60) return;
                Move(v);
                VIS[tin[v]%60]++;
        }
}

struct DSU {
        int par[MX];
 
        int find(int v) {
                return par[v]==v?v:par[v]=find(par[v]);
        }
 
        bool merge(int u, int v) {
                u=find(u),v=find(v);
                if(u==v) return false;
                par[u]=v;
                return true;
        }
 
        void prep(int N) {
                for(int i=0;i<N;i++) par[i]=i;
        }
} ds;
 
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
        ds.prep(N);
        
        for(int i=0;i<M;i++) {
                int x=A[i],y=B[i];
                if(ds.merge(x,y)) {
                        adj[x].push_back(y);
                        adj[y].push_back(x);
                }
        }

        dfs(0,-1);
        for(int i=0;i<N;i++) {
                sort(adj[i].begin(),adj[i].end(),[&](int i, int j) {
                        return sz[i]<sz[j];
                });     
        }
        euler.clear();
        timer=-1;
        dfs(0,-1);

        res|=get(P,V);
        cnt++;
        vis[tin[P]%60]=1;
        VIS[tin[P]%60]++;
        dfs0(P,0);
 
        return res;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1296 KB Output is correct
2 Correct 0 ms 1312 KB Output is correct
3 Correct 1 ms 1300 KB Output is correct
4 Correct 1 ms 1296 KB Output is correct
5 Correct 1 ms 1308 KB Output is correct
6 Incorrect 1 ms 1308 KB Wrong Answer [7]
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3928 KB Output is correct
2 Correct 17 ms 3960 KB Output is correct
3 Correct 17 ms 3936 KB Output is correct
4 Incorrect 11 ms 3292 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1308 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 2 ms 1840 KB Output is correct
5 Correct 2 ms 1848 KB Output is correct
6 Correct 2 ms 1848 KB Output is correct
7 Correct 2 ms 1844 KB Output is correct
8 Correct 2 ms 1848 KB Output is correct
9 Correct 9 ms 4316 KB Output is correct
10 Correct 9 ms 4312 KB Output is correct
11 Correct 9 ms 4316 KB Output is correct
12 Correct 0 ms 1308 KB Output is correct
13 Correct 1 ms 1296 KB Output is correct
14 Correct 1 ms 1296 KB Output is correct
15 Correct 0 ms 1308 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3888 KB Output is correct
2 Correct 19 ms 3936 KB Output is correct
3 Correct 17 ms 3936 KB Output is correct
4 Correct 13 ms 3288 KB Output is correct
5 Correct 11 ms 4056 KB Output is correct
6 Correct 12 ms 3800 KB Output is correct
7 Correct 11 ms 3808 KB Output is correct
8 Correct 11 ms 3540 KB Output is correct
9 Correct 11 ms 3548 KB Output is correct
10 Correct 9 ms 3296 KB Output is correct
11 Correct 10 ms 3292 KB Output is correct
12 Correct 10 ms 3020 KB Output is correct
13 Correct 10 ms 3280 KB Output is correct
14 Correct 10 ms 3276 KB Output is correct
15 Correct 11 ms 3300 KB Output is correct
16 Correct 11 ms 3288 KB Output is correct
17 Correct 11 ms 3288 KB Output is correct
18 Correct 11 ms 3292 KB Output is correct
19 Correct 11 ms 3288 KB Output is correct
20 Correct 8 ms 3800 KB Output is correct
21 Correct 8 ms 3808 KB Output is correct
22 Correct 11 ms 3800 KB Output is correct
23 Correct 11 ms 3808 KB Output is correct
24 Correct 11 ms 3808 KB Output is correct
25 Correct 11 ms 3808 KB Output is correct
26 Correct 11 ms 3800 KB Output is correct
27 Correct 13 ms 4340 KB Output is correct
28 Correct 10 ms 3552 KB Output is correct
29 Correct 10 ms 3524 KB Output is correct
30 Correct 11 ms 3788 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3944 KB Output is correct
2 Correct 17 ms 3932 KB Output is correct
3 Incorrect 17 ms 3816 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -