제출 #401384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
401384		ja_kingy	Fish (IOI08_fish)	C++14	37 / 100	526 ms	27372 KiB

fish

#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> pii;
const int mxF = 5e5, SZ = 1<<19;
int f,k,m,cnt[mxF],ord[mxF],st[2*SZ],ans;
vector<int> of_type[mxF];

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

int qry(int l, int r) {
    int res = 1;
    for (l += SZ, r += SZ; 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;
}

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 4 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 0 / 6
• Subtask 8: 6 / 6
• Subtask 9: 6 / 6
• Subtask 10: 0 / 6
• Subtask 11: 7 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 5 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5