oj.uz

Submission #763584

# Submission time Handle Problem Language Result Execution time Memory
763584 2023-06-22T13:25:53 Z keta_tsimakuridze Fish (IOI08_fish) C++14
4 / 100
 572 ms 22232 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5; // !
int t[4 * N], mod, f[N];
struct fish {
    int len, c;
} p[N];
int T = 0;
bool cmp(fish x, fish y) {
    return (y.len > x.len);
}
void build(int u, int l, int r) {
    t[u] = 1;
    if(l == r) return;
    int mid = (l + r) / 2;
    build(2 * u, l, mid);
    build(2 * u + 1, mid + 1, r);
}
void upd(int u, int id, int l, int r, int v) {
    if(l > id || r < id) return;
    if(l == r) {
        t[u] += v;
        if(t[u] < 1) t[u] = 1;
        return;
    }
    int mid = (l + r) / 2;
    if(id <= mid) upd(2 * u, id, l, mid, v); else upd(2 * u + 1, id, mid + 1, r, v);
    t[u] = t[2 * u] * t[2 * u + 1] % mod;
}
int get(int u, int st, int en, int l, int r) {
    if(l > en || r < st) return 1;
    if(st <= l && r <= en) return t[u];
    int mid = (l + r) / 2;
    return get(2 * u, st, en, l, mid) * get(2 * u + 1, st, en, mid + 1, r) % mod;
}
main(){
    int n, k;
    cin >> n >> k >> mod;
    for(int i = 1; i <= n; i++) {
        cin >> p[i].len >> p[i].c;
    }
    build(1, 1, k);
    sort(p + 1, p + n + 1, cmp);
    int ans = 0, L = 0;
    vector<int> cn(k + 16);
    while(L < n && p[L + 1].len * 2 <= p[n].len) ++L, upd(1, p[L].c, 1, k, 1), ++cn[p[L].c];
    int l = L;
    for(int i = n; i >= 1; i--) {
        while(l > 0 && p[l].len * 2 > p[i].len) upd(1, p[l].c, 1, k, -1), --l;
        if(get(1, p[i].c, p[i].c, 1, k) == cn[p[i].c] + 1 && !f[p[i].c]) {
            ans = (ans + get(1, 1, p[l].c - 1, 1, k) * get(1, p[l].c + 1, k, 1, k) % mod) % mod;
        }
        if(!f[p[i].c]) f[p[i].c] = i;
    }
    build(1, 1, k);
    l = 0;
    while(l < n && p[l + 1].len * 2 <= p[n].len) ++l, upd(1, p[l].c, 1, k, 1);
    for(int i = n; i >= 1; i--) {
        while(l > 0 && p[l].len * 2 > p[i].len) upd(1, p[l].c, 1, k, -1), --l;
        if(f[p[i].c] == i) {
            ans = (ans + get(1, 1, p[i].c - 1, 1, k) * get(1, p[i].c + 1, k, 1, k) % mod
                   * (get(1, p[i].c, p[i].c, 1, k) - (get(1, p[i].c, p[i].c, 1, k) == cn[p[i].c] + 1)) % mod) % mod;
                   if(i == 1) T = 1;
//            cout << get(1, 1, 1, 1, k) << " "<< endl;
            f[p[i].c] = i;
            upd(1, p[i].c, 1, k, -n);
        }
    }
    cout << ans;
 }

Compilation message

fish.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main(){
      | ^~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Runtime error 288 ms 22232 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 146 ms 5880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Incorrect 6 ms 488 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 258 ms 9016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 415 ms 14212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 244 ms 9308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 444 ms 13672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 516 ms 15720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 396 ms 13084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 559 ms 17380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 572 ms 15452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 476 ms 18712 KB Output isn't correct
2 Halted 0 ms 0 KB -