oj.uz

답안 #1032743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032743 2024-07-24T07:41:13 Z boyliguanhan Amusement Park (JOI17_amusement_park) C++17
73 / 100
 24 ms 22052 KB 
#include "Joi.h"
#include<bits/stdc++.h>
using namespace std;
namespace joi{
    vector<int>adj[100100],adj2[100100];
    bitset<100100>vis,inthisblok,deepest_path;
    int col[100100],CCcol,depdep=0,depnod,par[100100];
    void dfstree(int n){
        vis[n]=1;
        for(auto i:adj[n]){
            if(!vis[i]) {
                dfstree(i);
                adj2[i].push_back(n);
                adj2[n].push_back(i);
            }
        }
    }
    void getdeepest(int n,int dep){
        if(dep>depdep)
        depdep=dep,depnod=n;
        for(auto i:adj2[n])
            if(!col[i]&&i-par[n])
                getdeepest(i,dep+1);
    }
    void gowild(int n,int&CC,int color){
        if(!CC)return;
        if(!col[n])CC--,col[n]=color;
        for(auto i:adj2[n])
            if(i-par[n]&&(!col[i]||col[i]==color))
                gowild(i,CC,color);
    }
    void assigncols(int rt,int thecol){
        depdep=0;
        int CC=60;
        getdeepest(rt,1);
        int C=depnod;
        while(C-rt) deepest_path[C]=1,
            CC--,col[C]=thecol,C=par[C];
        gowild(rt,CC,thecol);
    }
    void preproc(int n,int p){
        par[n]=p;
        for(auto i:adj2[n])
            if(i-p)preproc(i,n);
    }
    int dfscol(int n){
        int sz=1;
        for(auto i:adj2[n])
            if(i-par[n])
                sz+=dfscol(i);
        if(sz>=60)
            assigncols(n,++CCcol),sz=0;
        return sz;
    }
}
vector<int>positions[10100];
void Joi(int N, int M, int A[], int B[], long long X, int T) {
    for(int i=0;i<M;i++)
        joi::adj[A[i]+1].push_back(B[i]+1),
        joi::adj[B[i]+1].push_back(A[i]+1);
    joi::dfstree(1);
    joi::preproc(1,0);
    joi::dfscol(1);
    for(int i=1;i<=N;i++) if(joi::col[i])
        positions[joi::col[i]].push_back(i);
    for(int i=1;i<=joi::CCcol;i++){
        long long X2=X;
        for(auto j:positions[i])
            MessageBoard(j-1,X2&1),X2>>=1;
    }
    for(int i=1;i<=N;i++) if(!joi::col[i])
        MessageBoard(i-1,0);
}

#include "Ioi.h"
#include<bits/stdc++.h>
using namespace std;
bitset<100100>messg;
void gooo(int nod){
    messg[nod]=Move(nod-1);
}
vector<int>path;
namespace ioi{
    vector<int>adj[100100],adj2[100100];
    bitset<100100>vis;
    int col[100100],CCcol,depdep=0,depnod,par[100100],deepest_path[100100];
    void dfstree(int n){
        vis[n]=1;
        for(auto i:adj[n]){
            if(!vis[i]) {
                dfstree(i);
                adj2[i].push_back(n);
                adj2[n].push_back(i);
            }
        }
        adj[n].clear();
    }
    void getdeepest(int n,int dep){
        if(dep>depdep)
            depdep=dep,depnod=n;
        for(auto i:adj2[n])
            if(!col[i]&&i-par[n])
                getdeepest(i,dep+1);
    }
    void gowild(int n,int&CC,int color){
        if(!CC)return;
        if(!col[n])CC--,col[n]=color;
        for(auto i:adj2[n])
            if(i-par[n]&&(!col[i]||col[i]==color))
                gowild(i,CC,color);
    }
    void assigncols(int rt,int thecol){
        depdep=0;
        int CC=60;
        getdeepest(rt,1);
        deepest_path[rt]=1;
        int C=depnod;
        while(C-rt) deepest_path[C]=1,
            CC--,col[C]=thecol,C=par[C];
        gowild(rt,CC,thecol);
    }
    void preproc(int n,int p){
        par[n]=p;
        for(auto i:adj2[n])
            if(i-p)preproc(i,n);
    }
    void makenocol(int n){
        col[n]=-1;
        for(auto i:adj2[n])
            if(i-par[n]&&!col[i])
                makenocol(i);
    }
    int dfscol(int n){
        int sz=1;
        for(auto i:adj2[n])
            if(i-par[n])
                sz+=dfscol(i);
        if(sz>=60)
            assigncols(n,++CCcol),sz=0;
        if(n==1&&sz){
            makenocol(n);
        }
        return sz;
    }
    void tofindall(int n){
        for(auto i:adj2[n])
            if(col[i]==col[n]&&!deepest_path[i]&&i!=par[n])
                gooo(i),tofindall(i);
        if(!deepest_path[n])
            gooo(par[n]);
        else for(auto i:adj2[n])
            if(i-par[n]&&deepest_path[i]&&col[i]==col[n])
                gooo(i),tofindall(i);
    }
    pair<int,int>getclos(int n){
        if(col[n]>0)return{0,n};
        pair<int,int>ans={1e9,1e9};
        for(auto i:adj2[n])
            if(i!=par[n])
                ans=min(ans,getclos(i));
        return {ans.first+1,ans.second};
    }
}
 
long long Ioi2(int P,int N){
    auto[x,y]=ioi::getclos(P);
    vector<int>path;
    do{
        path.push_back(y);
        y=ioi::par[y];
    }while(y-P);
    reverse(path.begin(),path.end());
    for(auto i:path)
        gooo(P=i);
    ioi::tofindall(P);
    vector<int>important;
    for(int i=1;i<=N;i++)
        if(ioi::col[i]==ioi::col[P])
            important.push_back(i);
    long long ans=0;
    reverse(important.begin(),important.end());
    for(auto i:important)
        ans=ans<<1|messg[i];
    return ans;
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    for(int i=0;i<M;i++)
        ioi::adj[A[i]+1].push_back(B[i]+1),
        ioi::adj[B[i]+1].push_back(A[i]+1);
    P++;
    messg[P]=V;
    ioi::dfstree(1);
    ioi::preproc(1,0);
    ioi::dfscol(1);
    if(ioi::col[P]==-1){
        return Ioi2(P,N);
    }
    while(!ioi::col[P])
        gooo(P=ioi::par[P]);
    while(ioi::col[ioi::par[P]]==ioi::col[P])
        gooo(P=ioi::par[P]);
    ioi::tofindall(P);
    vector<int>important;
    for(int i=1;i<=N;i++)
        if(ioi::col[i]==ioi::col[P])
            important.push_back(i);
    long long ans=0;
    reverse(important.begin(),important.end());
    for(auto i:important)
        ans=(ans<<1)|messg[i];
    return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12048 KB Output is correct
2 Correct 4 ms 12280 KB Output is correct
3 Correct 4 ms 12484 KB Output is correct
4 Correct 3 ms 12064 KB Output is correct
5 Correct 4 ms 12072 KB Output is correct
6 Correct 3 ms 12072 KB Output is correct
7 Correct 3 ms 12316 KB Output is correct
8 Correct 3 ms 12156 KB Output is correct
9 Correct 3 ms 12324 KB Output is correct
10 Correct 2 ms 12064 KB Output is correct
11 Correct 5 ms 12648 KB Output is correct
12 Correct 3 ms 12064 KB Output is correct
13 Correct 3 ms 12316 KB Output is correct
14 Correct 3 ms 12320 KB Output is correct
15 Correct 3 ms 12316 KB Output is correct
16 Correct 3 ms 12148 KB Output is correct
17 Correct 3 ms 12316 KB Output is correct
18 Correct 4 ms 12316 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 16156 KB Output is correct
2 Correct 19 ms 16140 KB Output is correct
3 Correct 20 ms 16296 KB Output is correct
4 Correct 13 ms 14708 KB Output is correct
5 Correct 13 ms 15168 KB Output is correct
6 Correct 13 ms 15172 KB Output is correct
7 Correct 13 ms 15176 KB Output is correct
8 Correct 13 ms 15164 KB Output is correct
9 Correct 13 ms 15168 KB Output is correct
10 Correct 11 ms 14660 KB Output is correct
11 Correct 11 ms 14660 KB Output is correct
12 Correct 13 ms 14376 KB Output is correct
13 Correct 11 ms 14368 KB Output is correct
14 Correct 11 ms 14560 KB Output is correct
15 Correct 13 ms 14648 KB Output is correct
16 Correct 16 ms 14588 KB Output is correct
17 Correct 13 ms 14648 KB Output is correct
18 Correct 14 ms 14908 KB Output is correct
19 Correct 12 ms 14652 KB Output is correct
20 Correct 11 ms 15164 KB Output is correct
21 Correct 11 ms 15248 KB Output is correct
22 Runtime error 17 ms 22052 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12076 KB Output is correct
2 Correct 3 ms 12060 KB Output is correct
3 Correct 3 ms 12060 KB Output is correct
4 Correct 4 ms 12868 KB Output is correct
5 Correct 4 ms 12880 KB Output is correct
6 Correct 4 ms 12872 KB Output is correct
7 Correct 4 ms 12896 KB Output is correct
8 Correct 5 ms 12860 KB Output is correct
9 Correct 11 ms 16204 KB Output is correct
10 Correct 11 ms 16192 KB Output is correct
11 Correct 12 ms 16204 KB Output is correct
12 Correct 4 ms 12064 KB Output is correct
13 Correct 3 ms 12048 KB Output is correct
14 Correct 4 ms 12048 KB Output is correct
15 Correct 3 ms 12064 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 16160 KB Output is correct
2 Correct 24 ms 16144 KB Output is correct
3 Correct 19 ms 16152 KB Output is correct
4 Correct 13 ms 14640 KB Output is correct
5 Correct 14 ms 15676 KB Output is correct
6 Correct 13 ms 15156 KB Output is correct
7 Correct 13 ms 15164 KB Output is correct
8 Correct 13 ms 14912 KB Output is correct
9 Correct 13 ms 15168 KB Output is correct
10 Correct 11 ms 14656 KB Output is correct
11 Correct 11 ms 14652 KB Output is correct
12 Correct 11 ms 14368 KB Output is correct
13 Correct 12 ms 14372 KB Output is correct
14 Correct 12 ms 14380 KB Output is correct
15 Correct 12 ms 14656 KB Output is correct
16 Correct 12 ms 14648 KB Output is correct
17 Correct 13 ms 14720 KB Output is correct
18 Correct 13 ms 14656 KB Output is correct
19 Correct 13 ms 14656 KB Output is correct
20 Correct 13 ms 15176 KB Output is correct
21 Correct 13 ms 15148 KB Output is correct
22 Correct 13 ms 15160 KB Output is correct
23 Correct 14 ms 14952 KB Output is correct
24 Correct 13 ms 15172 KB Output is correct
25 Correct 13 ms 15168 KB Output is correct
26 Correct 14 ms 15168 KB Output is correct
27 Correct 14 ms 15164 KB Output is correct
28 Correct 13 ms 14856 KB Output is correct
29 Correct 11 ms 14884 KB Output is correct
30 Correct 13 ms 15140 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 16164 KB Output is correct
2 Correct 19 ms 16160 KB Output is correct
3 Correct 24 ms 16200 KB Output is correct
4 Correct 13 ms 14656 KB Output is correct
5 Correct 15 ms 15936 KB Output is correct
6 Correct 16 ms 15156 KB Output is correct
7 Correct 13 ms 14896 KB Output is correct
8 Correct 13 ms 15160 KB Output is correct
9 Correct 13 ms 15172 KB Output is correct
10 Correct 12 ms 14664 KB Output is correct
11 Correct 11 ms 14660 KB Output is correct
12 Correct 12 ms 14368 KB Output is correct
13 Correct 12 ms 14376 KB Output is correct
14 Correct 11 ms 14472 KB Output is correct
15 Correct 13 ms 14648 KB Output is correct
16 Correct 13 ms 14640 KB Output is correct
17 Correct 13 ms 14648 KB Output is correct
18 Correct 15 ms 14648 KB Output is correct
19 Correct 14 ms 14628 KB Output is correct
20 Correct 13 ms 15164 KB Output is correct
21 Correct 13 ms 15416 KB Output is correct
22 Correct 15 ms 15172 KB Output is correct
23 Correct 14 ms 15160 KB Output is correct
24 Correct 14 ms 15164 KB Output is correct
25 Correct 13 ms 15160 KB Output is correct
26 Correct 16 ms 14916 KB Output is correct
27 Correct 13 ms 15128 KB Output is correct
28 Correct 13 ms 15164 KB Output is correct
29 Correct 12 ms 15124 KB Output is correct
30 Correct 14 ms 15144 KB Output is correct
31 Correct 3 ms 12276 KB Output is correct
32 Correct 3 ms 12268 KB Output is correct
33 Correct 3 ms 12324 KB Output is correct
34 Correct 2 ms 12064 KB Output is correct
35 Correct 2 ms 12048 KB Output is correct
36 Correct 2 ms 12064 KB Output is correct
37 Correct 3 ms 12208 KB Output is correct
38 Correct 3 ms 12152 KB Output is correct
39 Correct 3 ms 12052 KB Output is correct
40 Correct 3 ms 12064 KB Output is correct
41 Runtime error 7 ms 18200 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -