제출 #205095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
205095		Leonardo_Paes	Fish (IOI08_fish)	C++17	0 / 100	3086 ms	31608 KiB

fish

#include <bits/stdc++.h>

using namespace std;

#define int long long

typedef pair<int,int> pii;

#define f first
#define s second

const int maxn =  5e5+10, maxk = 30;

int qtd[maxn][maxk], mark[maxk];

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

    int n, k, m;

    cin >> n >> k >> m;

    vector<pii> v(n+1);

    vector<int> ans(n+1);

    for(int i=1; i<=n; i++){
        cin >> v[i].f >> v[i].s;
    }

    sort(v.begin(), v.end());

    for(int i=1; i<=n; i++){
        ans[i] = 1;
        qtd[i][v[i].s]++;

        memset(mark, 0, sizeof mark);

        mark[v[i].s] = 1;

        for(int j=1; j<i; j++){
            if(!mark[v[j].s] and v[i].f >= v[j].f + v[j].f){
                mark[v[j].s] = 1;

                ans[i] = (ans[i] + ans[j] - qtd[j][v[i].s] + 1 + m)%m;

                for(int q=1; q<=k; q++){
                    qtd[i][q] += qtd[j][q];
                }
            }
        }

        //cout << ans[i] << " " << qtd[i][v[i].s] << "\n";
    }

    cout << ans[n] << "\n";

    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6
• Subtask 10: 0 / 6
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5