oj.uz

Submission #44408

# Submission time Handle Problem Language Result Execution time Memory
44408 2018-04-02T03:59:54 Z xenoframium Amusement Park (JOI17_amusement_park) C++14
10 / 100
 40 ms 6832 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];

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;
static vi adj[10005];

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

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);
    return x;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1264 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 4696 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4936 KB Output is correct
2 Correct 4 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 6 ms 4936 KB Output is correct
5 Correct 6 ms 4936 KB Output is correct
6 Correct 7 ms 4936 KB Output is correct
7 Correct 6 ms 4936 KB Output is correct
8 Correct 7 ms 4936 KB Output is correct
9 Correct 17 ms 5124 KB Output is correct
10 Correct 17 ms 5408 KB Output is correct
11 Correct 19 ms 5600 KB Output is correct
12 Correct 4 ms 5696 KB Output is correct
13 Correct 4 ms 5696 KB Output is correct
14 Correct 4 ms 5696 KB Output is correct
15 Correct 4 ms 5696 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 6380 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 6832 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -