oj.uz

답안 #44429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44429 2018-04-02T06:25:29 Z xenoframium Amusement Park (JOI17_amusement_park) C++14
0 / 100
 50 ms 4848 KB 
#include "Joi.h"
#include <bits/stdc++.h>
#define F(i,s,n) for(int i=s;i<n;i++)
#define EB emplace_back
#define G(i,x) get<i>(x)
using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long long ll;
typedef vector<ii> vii;

static ll x;
static int vis[10005],cnt;
static vi adj[10005];

static void dfs(int v){
    if((1LL<<cnt++%60)&x){
        MessageBoard(v,1);
    }
    else MessageBoard(v,0);
    for(int u:adj[v]){
        if(!vis[u]){
            vis[u]=1;
            dfs(u);
        }
    }
}

void Joi(int N, int M, int A[], int B[], long long X, int T) {
    x=X;
    F(i,0,M){
        adj[A[i]].EB(B[i]);
        adj[B[i]].EB(A[i]);
    }
    vis[0]=1;
    dfs(0);
}


#include "Ioi.h"
#include <bits/stdc++.h>
#define F(i,s,n) for(int i=s;i<n;i++)
#define EB emplace_back
#define G(i,x) get<i>(x)
using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long long ll;
typedef vector<ii> vii;

static ll x;
static int vis[10005],p,hp,cnt,qcnt,pcnt,st[10005];
static vi adj[10005];

static void dfs(int v){
    int ccnt=cnt++;
    if(v==p){
        pcnt=ccnt;
        hp=1;
    }
    for(int u:adj[v]){
        if(!vis[u]){
            vis[u]=1;
            if(hp/*&&!st[ccnt+1]*/){
                if(Move(u))x|=(1LL<<(ccnt+1)%60);
                qcnt++;
                //st[ccnt+1]=1;
            }
            dfs(u);
            if(hp){
                if(Move(v))x|=(1LL<<ccnt%60);
                qcnt++;
                st[ccnt]=1;
            }
        }
    }
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    p=P;
    F(i,0,M){
        adj[A[i]].EB(B[i]);
        adj[B[i]].EB(A[i]);
    }
    vis[0]=1;
    dfs(0);
    //if(V)x|=(1<<pcnt%60);
    return x;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4584 KB Output is correct
2 Correct 4 ms 4584 KB Output is correct
3 Correct 4 ms 4584 KB Output is correct
4 Incorrect 6 ms 4584 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

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

Subtask #5
0 / 17.0

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