oj.uz

Submission #401382

# Submission time Handle Problem Language Result Execution time Memory
401382 2021-05-10T05:44:22 Z ja_kingy Fish (IOI08_fish) C++14
30 / 100
 505 ms 35144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> pii;
const int mxF = 5e5, INF = 1e9;
int f,k,m,cnt[mxF],ord[mxF],st[1<<20],ans;
vector<int> of_type[mxF];

void upd(int x, int v) {
    st[x += k] = v;
    for (; x/=2; ) st[x] = st[x*2]*st[x*2+1]%m; 
}

int qry(int l, int r) {
    int res = 1;
    for (l += k, r += k; l < r; l/=2, r/=2) {
        if (l&1) res=res*st[l++]%m;
        if (r&1) res=res*st[--r]%m;
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> f >> k >> m;
    vector<pii> fish(f);
    for (int i = 0,l,x; i < f; ++i) {
        cin >> l >> x;
        x--;
        of_type[x].push_back(l);
        fish[i] = {l, x};
    }
    sort(fish.begin(), fish.end());
    for (int x = 0; x < k; ++x) sort(of_type[x].begin(), of_type[x].end());
    vector<pii> types(k);
    for (int i = 0; i < k; ++i) {
        types[i] = {of_type[i].back(), i};
    }    
    sort(types.begin(), types.end());
    for (int i = 0; i < k; ++i) ord[types[i].second] = i;
    int smallest = 0;
    for (auto [l,x]: types) {
        while (fish[smallest].first <= l/2) {
            cnt[fish[smallest].second]++;
            upd(ord[fish[smallest].second], cnt[fish[smallest].second]+1);
            smallest++;
        }
        int ltm = qry(0, ord[x]);
        ans = (ans+(ltm*cnt[x]))%m;
        int sm_of_type = *upper_bound(of_type[x].begin(), of_type[x].end(), l/2);
        ans = (ans+(ltm*qry(ord[x]+1, lower_bound(types.begin(), types.end(), make_pair(2*sm_of_type,0))-types.begin())))%m;
    }
    cout << ans;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:43:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |     for (auto [l,x]: types) {
      |               ^

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 12072 KB Output isn't correct

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 11980 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 11980 KB Output isn't correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11980 KB Output is correct
2 Correct 9 ms 12076 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12068 KB Output is correct
2 Correct 205 ms 24664 KB Output is correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 12080 KB Output isn't correct

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 17376 KB Output is correct
2 Correct 112 ms 18732 KB Output is correct

Subtask #10
0 / 6.0

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

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
0 / 7.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 266 ms 27264 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 25192 KB Output is correct
2 Incorrect 297 ms 29760 KB Output isn't correct

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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