oj.uz

Submission #257520

# Submission time Handle Problem Language Result Execution time Memory
257520 2020-08-04T11:25:41 Z mhy908 None (JOI16_snowy) C++14
55 / 100
 23 ms 1452 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], d[510], cnt[510];
static vector<pii> link[510];

static void dfs(int num, int par, int dep){
    d[num]=dep;
    if(dep%MAXD==0)buc[num]=++re;
    for(auto i:link[num]){
        if(i.F==par)continue;
        dfs(i.F, num, dep+1);
    }
}

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, 0);
}

static void dfs2(int num, int par, int dis){
    if(d[num]%MAXD==0){
        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], d[510];
static vector<pii> link[510];

static void dfs(int num, int p, int dep){
    d[num]=dep;
    if(dep%MAXD==0)buc[num]=++re;
    for(auto i:link[num]){
        if(i.F==p)continue;
        par[i.F]=num, ped[i.F]=i.S;
        dfs(i.F, num, dep+1);
    }
}

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, 0);
}

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:10:12: warning: 'getL' defined but not used [-Wunused-variable]
 static int getL;
            ^~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 996 KB Output is correct
2 Correct 2 ms 788 KB Output is correct
3 Correct 3 ms 832 KB Output is correct
4 Correct 4 ms 1120 KB Output is correct
5 Correct 7 ms 1184 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 7 ms 1176 KB Output is correct
8 Correct 7 ms 1048 KB Output is correct
9 Correct 7 ms 1176 KB Output is correct
10 Correct 7 ms 1176 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1436 KB Output is correct
2 Correct 8 ms 1188 KB Output is correct
3 Correct 8 ms 1308 KB Output is correct
4 Correct 8 ms 1340 KB Output is correct
5 Correct 8 ms 1280 KB Output is correct
6 Correct 9 ms 1052 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 8 ms 1440 KB Output is correct
9 Correct 8 ms 1180 KB Output is correct
10 Correct 8 ms 1424 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1280 KB Output is correct
2 Correct 15 ms 1340 KB Output is correct
3 Correct 20 ms 1396 KB Output is correct
4 Correct 13 ms 1340 KB Output is correct
5 Correct 13 ms 1404 KB Output is correct
6 Correct 15 ms 1340 KB Output is correct
7 Correct 23 ms 1396 KB Output is correct
8 Correct 21 ms 1340 KB Output is correct
9 Correct 21 ms 1392 KB Output is correct
10 Correct 21 ms 1392 KB Output is correct
11 Correct 21 ms 1400 KB Output is correct
12 Correct 15 ms 1280 KB Output is correct
13 Correct 16 ms 1384 KB Output is correct
14 Correct 15 ms 1396 KB Output is correct
15 Correct 15 ms 1392 KB Output is correct
16 Correct 16 ms 1340 KB Output is correct
17 Correct 13 ms 1404 KB Output is correct
18 Correct 15 ms 1280 KB Output is correct
19 Correct 13 ms 1340 KB Output is correct
20 Correct 15 ms 1340 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1452 KB Output is correct
2 Correct 15 ms 1332 KB Output is correct
3 Runtime error 2 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -