oj.uz

답안 #967570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967570 2024-04-22T12:55:41 Z happy_node Amusement Park (JOI17_amusement_park) C++17
10 / 100
 19 ms 4936 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(tin[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++) {
                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(tin[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];
 
void dfs0(int v, int p) {
        if(cnt==60) return;
        for(auto u:adj[v]) {
                if(u==p) continue;
                if(!vis[tin[u]%60]) cnt++;
                vis[tin[u]%60]=1;
                res|=get(u,Move(u));
                dfs0(u,v);
                if(cnt==60) return;
                Move(v);
        }
}

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);
 
        int k=V;
        while(sz[P]<60) {
                P=par[P];
                k=Move(P);
        }
 
        res|=get(P,k);
        cnt++;
        vis[tin[P]%60]=1;
        dfs0(P,par[P]);
 
        return res;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1488 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 3940 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1296 KB Output is correct
2 Correct 1 ms 1288 KB Output is correct
3 Correct 1 ms 1508 KB Output is correct
4 Correct 2 ms 1844 KB Output is correct
5 Correct 2 ms 1856 KB Output is correct
6 Correct 2 ms 1852 KB Output is correct
7 Correct 2 ms 1860 KB Output is correct
8 Correct 2 ms 1856 KB Output is correct
9 Correct 9 ms 4932 KB Output is correct
10 Correct 8 ms 4924 KB Output is correct
11 Correct 9 ms 4936 KB Output is correct
12 Correct 0 ms 1312 KB Output is correct
13 Correct 1 ms 1312 KB Output is correct
14 Correct 2 ms 1292 KB Output is correct
15 Correct 1 ms 1312 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 3920 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 3936 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -