oj.uz

Submission #257528

# Submission time Handle Problem Language Result Execution time Memory
257528 2020-08-04T11:33:32 Z mhy908 None (JOI16_snowy) C++14
0 / 100
 17 ms 1332 KB 
#include "Anyalib.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
static int getL;

static int n, MAXD=10, re;
static int buc[510], sz[510], cnt[510];
static vector<pii> link[510];

static void dfs(int num, int par){
    sz[num]=1;
    if(par==-1)buc[num]=++re;
    for(auto i:link[num]){
        if(i.F==par)continue;
        dfs(i.F, num);
        sz[num]+=sz[i.F];
    }
    if(sz[num]>=10&&par>=0)buc[num]=++re, sz[num]=0;
}

void InitAnya(int N, int A[], int B[]){
    n=N;
    for(int i=0; i<n-1; i++){
        link[A[i]].eb(B[i], i+1);
        link[B[i]].eb(A[i], i+1);
    }
    dfs(0, -1);
}

static void dfs2(int num, int par, int dis){
    if(buc[num]){
        int tmp=dis;
        for(int i=buc[num]*9-9; i<buc[num]*9; i++){
            assert(i<=500);
            Save(i, tmp%2);
            tmp/=2;
        }
    }
    for(auto i:link[num]){
        if(i.F==par)continue;
        dfs2(i.F, num, dis+cnt[i.S]);
    }
}

void Anya(int C[]){
    for(int i=0; i<n-1; i++){
        cnt[i+1]=C[i];
        Save(501+i, C[i]);
    }
    dfs2(0, -1, 0);
}
/*
3
0 1
1 2
1
11
3
0 1 2
*/

#include "Borislib.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

static int n, MAXD=10, re;
static int par[510], ped[510], buc[510], sz[510];
static vector<pii> link[510];

static void dfs(int num, int p){
    sz[num]=1;
    if(p==-1)buc[num]=++re;
    for(auto i:link[num]){
        if(i.F==p)continue;
        dfs(i.F, num);
        par[num]=p, ped[num]=i.S;
        sz[num]+=sz[i.F];
    }
    if(sz[num]>=10&&par>=0)buc[num]=++re, sz[num]=0;
}

void InitBoris(int N, int A[], int B[]){
    n=N;
    for(int i=0; i<n-1; i++){
        link[A[i]].eb(B[i], i+1);
        link[B[i]].eb(A[i], i+1);
    }
    dfs(0, -1);
}

static int dfs2(int num){
    if(buc[num]){
        int ret=0;
        for(int i=buc[num]*9-1; i>=buc[num]*9-9; i--){
            ret*=2;
            ret+=Ask(i);
        }
        return ret;
    }
    return dfs2(par[num])+Ask(ped[num]+500);
}

int Boris(int city){
    return dfs2(city);
}

Compilation message

Anya.cpp:12:15: warning: 'MAXD' defined but not used [-Wunused-variable]
 static int n, MAXD=10, re;
               ^~~~
Anya.cpp:10:12: warning: 'getL' defined but not used [-Wunused-variable]
 static int getL;
            ^~~~

Boris.cpp:11:15: warning: 'MAXD' defined but not used [-Wunused-variable]
 static int n, MAXD=10, re;
               ^~~~

Subtask #1
0 / 15.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 35.0

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

Subtask #4
0 / 45.0

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