oj.uz

Submission #897162

# Submission time Handle Problem Language Result Execution time Memory
897162 2024-01-02T16:16:50 Z bLIC Regions (IOI09_regions) C++17
4 / 100
 2395 ms 131076 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;

vvi adj, emp, tour;
vi reg, cntreg, idofreg, currcnt, st, en;
vvl cntans;
int timer;
int n;

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

void solve(){

    timer = 0;
    int r, q;cin>>n>>r>>q;
    adj.resize(n);
    emp.resize(r);
    tour.resize(r);
    reg.resize(n);
    cntreg.resize(r);
    idofreg.resize(r);
    currcnt.resize(r);
    st.resize(n);
    en.resize(n);
    cntans.resize(B+10, vl(r, 0));
    {
        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:185:14: warning: unused variable 'i' [-Wunused-variable]
  185 |     int t=1, i = 1;
      |              ^

Subtask #1
4.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 756 KB Output is correct
5 Runtime error 1 ms 856 KB Execution killed with signal 11
6 Runtime error 2 ms 2416 KB Execution killed with signal 11
7 Runtime error 1 ms 1880 KB Execution killed with signal 11
8 Runtime error 2 ms 2392 KB Execution killed with signal 11
9 Runtime error 3 ms 3364 KB Execution killed with signal 11
10 Runtime error 4 ms 4952 KB Execution killed with signal 11
11 Runtime error 5 ms 4952 KB Execution killed with signal 11
12 Runtime error 7 ms 6916 KB Execution killed with signal 11
13 Runtime error 7 ms 5772 KB Execution killed with signal 11
14 Runtime error 8 ms 6172 KB Execution killed with signal 11
15 Runtime error 10 ms 8536 KB Execution killed with signal 11

Subtask #2
0 / 85.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 12848 KB Execution killed with signal 11
2 Runtime error 20 ms 11904 KB Execution killed with signal 11
3 Runtime error 21 ms 15624 KB Execution killed with signal 11
4 Runtime error 26 ms 34328 KB Execution killed with signal 11
5 Runtime error 32 ms 43108 KB Execution killed with signal 11
6 Runtime error 43 ms 59516 KB Execution killed with signal 11
7 Runtime error 64 ms 84752 KB Execution killed with signal 11
8 Runtime error 69 ms 89852 KB Execution killed with signal 11
9 Runtime error 2257 ms 131072 KB Execution killed with signal 9
10 Runtime error 210 ms 131076 KB Execution killed with signal 9
11 Runtime error 199 ms 131072 KB Execution killed with signal 9
12 Runtime error 2355 ms 131072 KB Execution killed with signal 9
13 Runtime error 2395 ms 131072 KB Execution killed with signal 9
14 Runtime error 2266 ms 131072 KB Execution killed with signal 9
15 Runtime error 198 ms 131072 KB Execution killed with signal 9
16 Runtime error 188 ms 131072 KB Execution killed with signal 9
17 Runtime error 2228 ms 131072 KB Execution killed with signal 9