답안 #897088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897088 2024-01-02T14:22:16 Z bLIC Regions (IOI09_regions) C++17
4 / 100
3521 ms 125928 KB
/**
 *  Author: Anil Byar
**/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T> bool chmin(T& a, T b){return (a>b?a=b,1:0);}
template<class T> bool chmax(T& a, T b){return (a<b?a=b,1:0);}
template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully

const int N = 2e5+1, R = 25000;
const int B = 450;

vi adj[N], emp[R], tour[R];
int reg[N];
int cntreg[R], idofreg[R];
long long cntans[B+10][R];
int currcnt[R];
vector<int> anc;
int st[N], en[N], timer;

void dfs(int node){
    st[node] = timer++;
    tour[reg[node]].push_back(st[node]);
    int id = idofreg[reg[node]];
    if (id && (currcnt[id]++)==0) anc.push_back(id);
    for (int x:adj[node]){
        for (int y:anc) cntans[y][reg[x]] += currcnt[y];
        dfs(x); 
    }
    if (id && (--currcnt[id])==0) anc.pop_back();
    en[node] = timer++;
}

void solve(){
    memset(idofreg, 0, sizeof(idofreg));
    memset(cntreg, 0, sizeof(cntreg));
    memset(cntans, 0, sizeof(cntans));
    memset(currcnt, 0, sizeof(currcnt));
    timer = 0;
    int n, r, q;cin>>n>>r>>q;
    {
        int x;cin>>x;
        x--;
        cntreg[x]++;
        emp[x].push_back(0);
        reg[0] = x;
    }
    for (int i = 1;i<n;i++){
        int p, x;cin>>p>>x;
        x--;p--;
        cntreg[x]++;
        reg[i] = x;
        emp[x].push_back(i);
        adj[p].push_back(i);
    }
    int rg = 0;
    for (int i = 0;i<r;i++){
        if (cntreg[i]>=B) idofreg[i] = ++rg;
    }
    assert(rg<=B);
    dfs(0);
    while(q--){
        int r1, r2;cin>>r1>>r2;
        r1--;
        r2--;
        if (idofreg[r1]) cout<<cntans[idofreg[r1]][r2];
        else {
            ll ans = 0;
            for (int e:emp[r1]){
                ans += lower_bound(all(tour[r2]), en[e]) - upper_bound(all(tour[r2]), st[e]);
            }
            cout<<ans;
        }
        cout<<endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
    freopen("debug.dbg", "w", stderr);
    int tt = clock();
#endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifndef ONLINE_JUDGE
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

regions.cpp: In function 'int main()':
regions.cpp:179:14: warning: unused variable 'i' [-Wunused-variable]
  179 |     int t=1, i = 1;
      |              ^
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 98640 KB Output is correct
2 Correct 13 ms 98648 KB Output is correct
3 Correct 14 ms 98804 KB Output is correct
4 Correct 14 ms 98648 KB Output is correct
5 Runtime error 16 ms 98836 KB Execution killed with signal 13
6 Runtime error 22 ms 98904 KB Execution killed with signal 13
7 Runtime error 29 ms 98884 KB Execution killed with signal 13
8 Runtime error 30 ms 98920 KB Execution killed with signal 13
9 Runtime error 40 ms 99512 KB Execution killed with signal 13
10 Runtime error 53 ms 99284 KB Execution killed with signal 13
11 Runtime error 85 ms 99560 KB Execution killed with signal 13
12 Runtime error 96 ms 100192 KB Execution killed with signal 13
13 Runtime error 119 ms 99628 KB Execution killed with signal 13
14 Runtime error 204 ms 100224 KB Execution killed with signal 13
15 Runtime error 219 ms 104512 KB Execution killed with signal 13
# 결과 실행 시간 메모리 Grader output
1 Runtime error 1375 ms 103424 KB Execution killed with signal 13
2 Runtime error 1647 ms 101596 KB Execution killed with signal 13
3 Runtime error 2312 ms 106000 KB Execution killed with signal 13
4 Runtime error 166 ms 100332 KB Execution killed with signal 13
5 Runtime error 226 ms 102980 KB Execution killed with signal 13
6 Runtime error 315 ms 101544 KB Execution killed with signal 13
7 Runtime error 1142 ms 102408 KB Execution killed with signal 13
8 Runtime error 661 ms 109944 KB Execution killed with signal 13
9 Runtime error 1674 ms 107544 KB Execution killed with signal 13
10 Runtime error 2780 ms 115704 KB Execution killed with signal 13
11 Runtime error 3521 ms 106064 KB Execution killed with signal 13
12 Runtime error 888 ms 107568 KB Execution killed with signal 13
13 Runtime error 1370 ms 108496 KB Execution killed with signal 13
14 Runtime error 1435 ms 107716 KB Execution killed with signal 13
15 Runtime error 2215 ms 114992 KB Execution killed with signal 13
16 Runtime error 2113 ms 125928 KB Execution killed with signal 13
17 Runtime error 2069 ms 123580 KB Execution killed with signal 13