oj.uz

Submission #653337

# Submission time Handle Problem Language Result Execution time Memory
653337 2022-10-26T15:05:43 Z Vladth11 Fish (IOI08_fish) C++14
100 / 100
 1535 ms 59064 KB 
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>

#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

#pragma GCC optimize("Ofast")

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;

const int bSize = 11;
const int bits = 23;
const int NMAX = 500001;

int MOD;
int dm;

class Aint {
public:
    int aint[NMAX * 4];
    void init() {
        for(int i = 0; i < NMAX * 4; i++)
            aint[i] = 1;
    }
    void add(int node, int st, int dr, int l, int x) {
        if(st == dr) {
            aint[node] += x;
            aint[node] = max(aint[node], 1);
            return;
        }
        int mid = (st + dr) / 2;
        if(l <= mid) {
            add(node * 2, st, mid, l, x);
        } else {
            add(node * 2 + 1, mid + 1, dr, l, x);
        }
        aint[node] = (aint[node * 2] % MOD) * (aint[node * 2 + 1] % MOD);
        aint[node] %= MOD;
    }
    int query(int node, int st, int dr, int a, int b){
        if(a <= st && dr <= b)
            return aint[node];
        int mid = (st + dr) / 2;
        int prod = 1;
        if(a <= mid){
            prod *= query(node * 2, st, mid, a, b);
            prod %= MOD;
        }
        if(b > mid){
            prod *= query(node * 2 + 1, mid + 1, dr, a, b);
            prod %= MOD;
        }
        return prod;
    }
    void update(int node, int st, int dr, int l, int x) {
        if(st == dr) {
            dm = aint[node];
            aint[node] = x;
            //aint[node] = max(aint[node], 1);
            return;
        }
        int mid = (st + dr) / 2;
        if(l <= mid) {
            update(node * 2, st, mid, l, x);
        } else {
            update(node * 2 + 1, mid + 1, dr, l, x);
        }
        aint[node] = (aint[node * 2] % MOD) * (aint[node * 2 + 1] % MOD);
        aint[node] %= MOD;
    }
} aint, banned;

int imp[NMAX];
int col[NMAX];
int maxi[NMAX];
pii v[NMAX];
int f[NMAX];
pii cine[NMAX];
vector <int> g[NMAX];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k, i;
    cin >> n >> k >> MOD;
    for(i = 1; i <= n; i++) {
        cin >> v[i].first >> v[i].second;
        g[v[i].second].push_back(v[i].first);
    }
    sort(v + 1, v + n + 1);
    for(i = n; i >= 1; i--) {
        if(!col[v[i].second]) {
            imp[i] = 1;
        }
        col[v[i].second]++;
    }
    int cnt = 0;
    for(i = 1; i <= n; i++){
        if(imp[i]){
            cine[++cnt] = v[i];
            f[cine[cnt].second] = cnt;
        }
    }
    aint.init();
    banned.init();
    for(i = 1; i <= n; i++){
        sort(g[i].begin(), g[i].end());
        maxi[i] = col[i];
        if(!f[i]) continue;
        aint.update(1, 1, n, f[i], col[i] + 1);
        banned.update(1, 1, n, f[i], col[i] + 1);
    }
    int dr = n, st = n;
    int rez = 0;
    for(i = n; i >= 1; i--){
        while(st >= 1 && v[st].first * 2 > v[i].first){
            aint.add(1, 1, n, f[v[st].second], -1);
            banned.add(1, 1, n, f[v[st].second], -1);
            col[v[st].second]--;
            st--;
        }
        if(i == n){
            for(int j = 1; j <= n; j++){
                maxi[j] = col[j];
            }
        }
        if(imp[i]){
            if(i != n){
                aint.update(1, 1, n, f[v[i].second], 1);
                int r = f[v[i].second];
                int pas = (1 << bits);
                int b = g[v[i].second][col[v[i].second]];
                while(pas){
                    if(r + pas <= k && b * 2 > cine[r + pas].first)
                        r += pas;
                    pas /= 2;
                }
                rez += aint.query(1, 1, n, 1, r);
                aint.update(1, 1, n, f[v[i].second], col[v[i].second] + 1);
                banned.add(1, 1, n, f[v[i].second], -1);
                rez %= MOD;
            }
            if(col[v[i].second] > 0 || i == n) /// avem frecventa mai mare ca 1..0
                rez += banned.aint[1];
            rez %= MOD;
            banned.update(1, 1, n, f[v[i].second], 1);
        }
    }
    cout << rez;
    return 0;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:119:9: warning: unused variable 'dr' [-Wunused-variable]
  119 |     int dr = n, st = n;
      |         ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27732 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27732 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27732 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27732 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27732 KB Output is correct
2 Correct 14 ms 27732 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27716 KB Output is correct
2 Correct 432 ms 36096 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27732 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27832 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 31392 KB Output is correct
2 Correct 220 ms 32060 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 27896 KB Output is correct
2 Correct 18 ms 27860 KB Output is correct
3 Correct 17 ms 27912 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 33388 KB Output is correct
2 Correct 461 ms 36072 KB Output is correct
3 Correct 455 ms 36488 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 37344 KB Output is correct
2 Correct 485 ms 36896 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 34708 KB Output is correct
2 Correct 499 ms 36816 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 36548 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 37936 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 36156 KB Output is correct
2 Correct 763 ms 42080 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 836 ms 42168 KB Output is correct
2 Correct 656 ms 39852 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 697 ms 43212 KB Output is correct
2 Correct 772 ms 41876 KB Output is correct
3 Correct 834 ms 45868 KB Output is correct
4 Correct 779 ms 42164 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1018 ms 45132 KB Output is correct
2 Correct 1397 ms 59064 KB Output is correct
3 Correct 1535 ms 59008 KB Output is correct
4 Correct 1362 ms 54356 KB Output is correct