답안 #52725 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52725	2018-06-26T13:01:18 Z	aquablitz11	Regions (IOI09_regions)	C++14	65 / 100	7100 ms	30512 KB

regions

// headers
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using piipi = pair<pii, int>;
using pipii = pair<int, pii>;
using plpii = pair<ll, pii>;
using ppii = pair<pii, pii>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
    using S = typename make_signed<T>::type;
    T s;
    PRNG(T _s = 0) : s(_s) {}
    T next() {
        T z = (s += x1);
        z = (z ^ (z >> y1)) * x2;
        z = (z ^ (z >> y2)) * x3;
        return z ^ (z >> y3);
    }
    T next(T n) { return next() % n; }
    S next(S l, S r) { return l + next(r - l + 1); }
    T operator()() { return next(); }
    T operator()(T n) { return next(n); }
    S operator()(S l, S r) { return next(l, r); }
    static T gen(T s) { return PRNG(s)(); }
    template<class U>
    void shuffle(U first, U last) {
        size_t n = last - first;
        for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
    }
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;
// program
int _main();
int main() {
    //ios::sync_with_stdio(false), cin.tie(0);
    //time_t begin = clock();
    int ret = _main();
    //time_t end = clock();
    //fprintf(stderr, "Program took %.3f seconds to compute\n", ((double)end-begin)/CLOCKS_PER_SEC);
    return ret;
}
 
/************************************************************
                CODE STARTS BELOW THIS POINT
************************************************************/
 
const int N = 200010;
const int K = 25010;
const int SN = 450;
 
int n, k, q, sn;
vector<int> mem[K], memp[K], G[N];
int pre[N], post[N], reg[N], tick, seq[N];
int spi[K], qs[N], prec[SN][K];

void dfs(int u)
{
    pre[u] = ++tick;
    seq[tick] = u;
    memp[reg[u]].pb(tick);
    fora(v, G[u]) dfs(v);
    post[u] = tick;
}

int _main()
{
    R(n, k, q);
    sn = sqrt(n);

    R(reg[1]);
    mem[reg[1]].pb(1);
    forx(i, 2, n) {
        int p;
        R(p, reg[i]);
        mem[reg[i]].pb(i);
        G[p].pb(i);
    }
    int cntsp = 0;
    for1(i, k) {
        memp[i].reserve(mem[i].size());
        if (mem[i].size() >= sn)
            spi[i] = ++cntsp;
    }
    dfs(1);
    for1(i, k) if (spi[i]) {
        fora(u, mem[i]) {
            ++qs[pre[u]];
            --qs[post[u]+1];
        }
        int sum = 0;
        for1(j, n) {
            sum += qs[j];
            prec[spi[i]][reg[seq[j]]] += sum;
            qs[j] = 0;
        }
    }

    while (q--) {
        int r1, r2;
        R(r1, r2);
        int ans = 0;
        if (spi[r1]) ans = prec[spi[r1]][r2];
        else fora(u, mem[r1]) {
            auto lb = lower_bound(all(memp[r2]), pre[u]);
            auto ub = upper_bound(all(memp[r2]), post[u]);
            ans += ub-lb;
        }
        W(ans);
        fflush(stdout);
    }

    return 0;
}

Compilation message

regions.cpp: In function 'll read_ll()':
regions.cpp:49:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                                        ~~^
regions.cpp: In function 'ull read_ull()':
regions.cpp:50:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                                           ~~^
regions.cpp: In function 'void _W(const ll&)':
regions.cpp:60:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 void _W(const ll &x) { printf("%" PRId64, x); }
                                           ~^
regions.cpp: In function 'void _W(const ull&)':
regions.cpp:61:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
 void _W(const ull &x) { printf("%" PRIu64, x); }
                                            ~^
regions.cpp: In function 'int _main()':
regions.cpp:143:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (mem[i].size() >= sn)
             ~~~~~~~~~~~~~~^~~~~
regions.cpp: In function 'int read_int()':
regions.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 int read_int() { int x; scanf("%d", &x); return x; }
                         ~~~~~^~~~~~~~~~
regions.cpp: In function 'll read_ll()':
regions.cpp:49:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
                      ~~~~~^~~~~~~~~~~~~~~~
regions.cpp: In function 'ull read_ull()':
regions.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
                         ~~~~~^~~~~~~~~~~~~~~~
regions.cpp: In function 'dbl read_dbl()':
regions.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
                         ~~~~~^~~~~~~~~~~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6136 KB	Output is correct
2	Correct	9 ms	6324 KB	Output is correct
3	Correct	11 ms	6376 KB	Output is correct
4	Correct	10 ms	6400 KB	Output is correct
5	Correct	13 ms	6400 KB	Output is correct
6	Correct	31 ms	6400 KB	Output is correct
7	Correct	38 ms	6400 KB	Output is correct
8	Correct	44 ms	6516 KB	Output is correct
9	Correct	79 ms	6796 KB	Output is correct
10	Correct	104 ms	6928 KB	Output is correct
11	Correct	158 ms	7212 KB	Output is correct
12	Correct	153 ms	7740 KB	Output is correct
13	Correct	154 ms	7740 KB	Output is correct
14	Correct	369 ms	8124 KB	Output is correct
15	Correct	405 ms	10080 KB	Output is correct

Subtask #2
50.0 / 85.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2259 ms	11320 KB	Output is correct
2	Correct	2935 ms	11320 KB	Output is correct
3	Correct	3685 ms	12860 KB	Output is correct
4	Correct	289 ms	12860 KB	Output is correct
5	Correct	404 ms	12860 KB	Output is correct
6	Correct	555 ms	12860 KB	Output is correct
7	Correct	1183 ms	12860 KB	Output is correct
8	Correct	1160 ms	19388 KB	Output is correct
9	Correct	3548 ms	19388 KB	Output is correct
10	Correct	3898 ms	30512 KB	Output is correct
11	Execution timed out	7100 ms	30512 KB	Time limit exceeded (wall clock)
12	Incorrect	1931 ms	30512 KB	Unexpected end of file - int32 expected
13	Incorrect	2720 ms	30512 KB	Unexpected end of file - int32 expected
14	Incorrect	2982 ms	30512 KB	Unexpected end of file - int32 expected
15	Incorrect	4527 ms	30512 KB	Unexpected end of file - int32 expected
16	Incorrect	3735 ms	30512 KB	Unexpected end of file - int32 expected
17	Incorrect	3505 ms	30512 KB	Unexpected end of file - int32 expected

답안 #52725

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 50.0 / 85.0

Subtask #1
15.0 / 15.0

Subtask #2
50.0 / 85.0