oj.uz

Submission #26243

# Submission time Handle Problem Language Result Execution time Memory
26243 2017-06-28T13:23:59 Z kajebiii None (JOI16_snowy) C++14
100 / 100
 22 ms 4228 KB 
#include "Anyalib.h"

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

const int MAX_N = 1e3 + 50;

static vector<pi> Ed[MAX_N];
static int N;

static pi Ix[MAX_N], Nr[MAX_N];
static int IN;

static int dfs(int v, int p) {
    for(pi &t : Ed[v]) {
        int w, ix; tie(w, ix) = t;
        if(w != p) {
            int st = IN;
            Nr[st] = pi(ix, +1); IN++;
            dfs(w, v);
            int en = IN;
            Nr[en] = pi(ix, -1); IN++;
            Ix[ix] = pi(st, en);
        }
    }
}
void InitAnya(int n, int a[], int b[]) {
    N = n;
    for(int i=0; i+1<n; i++) {
        Ed[a[i]].push_back(pi(b[i], i));
        Ed[b[i]].push_back(pi(a[i], i));
    }
    dfs(0, -1);
    return;
}

static int Sum[MAX_N];
void Anya(int C[]) {
    for(int i=0; i<IN/20*20+40; i++) 
        Sum[i] = 0;
    for(int i=0; i+1<N; i++) {
        int st, en; tie(st, en) = Ix[i];
        if(C[i] == 0) continue;
        Sum[st]++; Sum[en]--;
    }
    for(int i=1; i<IN/20*20+40; i++)
        Sum[i] += Sum[i-1];
    for(int i=0; i<N-1; i++)
        Save(i, C[i]);
    for(int i=1; i<=IN/20; i++) {
        int cnt[10] = {0, };
        int val = Sum[i*20-1];
        for(int k=0; k<10; k++) {
            cnt[k] = val & 1;
            val >>= 1;
        }
        for(int k=0; k<10; k++)
            Save(500 + 10 * (i-1) + k, cnt[k]);
    }
}

#include "Borislib.h"

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

const int MAX_N = 1e3 + 50;

static vector<pi> Ed[MAX_N];
static int N;

static pi Ix[MAX_N], Nr[MAX_N];
static int IN, ixP[MAX_N];

static int dfs(int v, int p) {
    for(pi &t : Ed[v]) {
        int w, ix; tie(w, ix) = t;
        if(w != p) {
            int st = IN;
            Nr[st] = pi(ix, +1); IN++;
            ixP[w] = ix;
            dfs(w, v);
            int en = IN;
            Nr[en] = pi(ix, -1); IN++;
            Ix[ix] = pi(st, en);
        }
    }
}
void InitBoris(int n, int a[] , int b[]) {
    N = n;
    for(int i=0; i+1<n; i++) {
        Ed[a[i]].push_back(pi(b[i], i));
        Ed[b[i]].push_back(pi(a[i], i));
    }
    dfs(0, -1);
    return;
}

int getG(int g) {
    if(g == 0) return 0;
    if(g > IN / 20) return 0;
    int res = 0;
    for(int k=9; k>=0; k--) {
        res *= 2;
        res += Ask(500 + 10 * (g-1) + k);
    }
    return res;
}
int getVal(int p) {
    if(p >= IN) return 0;
    int ix, t; tie(ix, t) = Nr[p];
    return t * Ask(ix);
}
int Boris(int city) {
    int ix = Ix[ixP[city]].one;

    int ans = 0;
    if(ix - ix / 20 * 20 < 10) {
        ans = getG(ix / 20);
        for(int i=ix/20*20; i<=ix; i++)
            ans += getVal(i);
    }else{
        ans = getG(ix / 20 + 1);
        for(int i=ix+1; i < (ix/20 + 1) * 20; i++)
            ans -= getVal(i);
    }
    return ans;
}

Compilation message

Anya.cpp: In function 'int dfs(int, int)':
Anya.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Boris.cpp: In function 'int dfs(int, int)':
Boris.cpp:39:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4228 KB Output is correct
2 Correct 0 ms 4228 KB Output is correct
3 Correct 0 ms 4228 KB Output is correct
4 Correct 3 ms 4228 KB Output is correct
5 Correct 6 ms 4228 KB Output is correct
6 Correct 6 ms 4228 KB Output is correct
7 Correct 6 ms 4228 KB Output is correct
8 Correct 6 ms 4228 KB Output is correct
9 Correct 3 ms 4228 KB Output is correct
10 Correct 6 ms 4228 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4228 KB Output is correct
2 Correct 9 ms 4228 KB Output is correct
3 Correct 9 ms 4228 KB Output is correct
4 Correct 6 ms 4228 KB Output is correct
5 Correct 6 ms 4228 KB Output is correct
6 Correct 6 ms 4228 KB Output is correct
7 Correct 6 ms 4228 KB Output is correct
8 Correct 9 ms 4228 KB Output is correct
9 Correct 6 ms 4228 KB Output is correct
10 Correct 9 ms 4228 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4228 KB Output is correct
2 Correct 22 ms 4228 KB Output is correct
3 Correct 16 ms 4228 KB Output is correct
4 Correct 13 ms 4228 KB Output is correct
5 Correct 16 ms 4228 KB Output is correct
6 Correct 16 ms 4228 KB Output is correct
7 Correct 19 ms 4228 KB Output is correct
8 Correct 9 ms 4228 KB Output is correct
9 Correct 16 ms 4228 KB Output is correct
10 Correct 16 ms 4228 KB Output is correct
11 Correct 13 ms 4228 KB Output is correct
12 Correct 19 ms 4228 KB Output is correct
13 Correct 19 ms 4228 KB Output is correct
14 Correct 19 ms 4228 KB Output is correct
15 Correct 16 ms 4228 KB Output is correct
16 Correct 16 ms 4228 KB Output is correct
17 Correct 22 ms 4228 KB Output is correct
18 Correct 16 ms 4228 KB Output is correct
19 Correct 16 ms 4228 KB Output is correct
20 Correct 16 ms 4228 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4228 KB Output is correct
2 Correct 12 ms 4228 KB Output is correct
3 Correct 19 ms 4228 KB Output is correct
4 Correct 19 ms 4228 KB Output is correct
5 Correct 16 ms 4228 KB Output is correct
6 Correct 12 ms 4228 KB Output is correct
7 Correct 12 ms 4228 KB Output is correct
8 Correct 12 ms 4228 KB Output is correct
9 Correct 16 ms 4228 KB Output is correct
10 Correct 16 ms 4228 KB Output is correct
11 Correct 16 ms 4228 KB Output is correct
12 Correct 16 ms 4228 KB Output is correct
13 Correct 16 ms 4228 KB Output is correct
14 Correct 16 ms 4228 KB Output is correct
15 Correct 19 ms 4228 KB Output is correct
16 Correct 12 ms 4228 KB Output is correct
17 Correct 19 ms 4228 KB Output is correct
18 Correct 16 ms 4228 KB Output is correct
19 Correct 9 ms 4228 KB Output is correct
20 Correct 9 ms 4228 KB Output is correct
21 Correct 12 ms 4228 KB Output is correct
22 Correct 16 ms 4228 KB Output is correct
23 Correct 16 ms 4228 KB Output is correct
24 Correct 12 ms 4228 KB Output is correct
25 Correct 19 ms 4228 KB Output is correct
26 Correct 22 ms 4228 KB Output is correct
27 Correct 9 ms 4228 KB Output is correct
28 Correct 16 ms 4228 KB Output is correct
29 Correct 13 ms 4228 KB Output is correct
30 Correct 16 ms 4228 KB Output is correct
31 Correct 12 ms 4228 KB Output is correct
32 Correct 16 ms 4228 KB Output is correct
33 Correct 16 ms 4228 KB Output is correct
34 Correct 16 ms 4228 KB Output is correct
35 Correct 6 ms 4228 KB Output is correct
36 Correct 12 ms 4228 KB Output is correct
37 Correct 12 ms 4228 KB Output is correct
38 Correct 16 ms 4228 KB Output is correct
39 Correct 12 ms 4228 KB Output is correct
40 Correct 16 ms 4228 KB Output is correct
41 Correct 16 ms 4228 KB Output is correct
42 Correct 19 ms 4228 KB Output is correct
43 Correct 12 ms 4228 KB Output is correct
44 Correct 12 ms 4228 KB Output is correct
45 Correct 12 ms 4228 KB Output is correct
46 Correct 19 ms 4228 KB Output is correct
47 Correct 19 ms 4228 KB Output is correct
48 Correct 12 ms 4228 KB Output is correct
49 Correct 16 ms 4228 KB Output is correct
50 Correct 9 ms 4228 KB Output is correct