제출 #447945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447945		parsabahrami	Fish (IOI08_fish)	C++17	0 / 100	293 ms	16852 KiB

fish

/* I do it for the glory */
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x) (int) x.size()
#define F first
#define S second

const int N = 5e5 + 10;
int F[N], lst[N], ord[N], A[N], g[N], k, md, n;

void upd(int p) {
    for (; p < N; p += p & -p) 
        F[p] = 2ll * F[p] % md;
}

int get(int p) {
    int ret = 1;
    for (; p; p -= p & -p) ret = 1ll * F[p] * ret % md;
    return ret;
}

int main() {
    scanf("%d%d%d", &n, &k, &md);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d", &A[i], &g[i]), ord[i] = i;
    }
    sort(ord + 1, ord + n + 1, [&] (int i, int j) { return A[i] < A[j]; });
    for (int _ = n; _; _--) {
        int i = ord[_]; 
        if (!lst[g[i]]) lst[g[i]] = _;
    }
    int ret = 0;
    fill(F, F + N, 1);
    for (int j = 1, pt = 0; j <= n; j++) {
        int i = ord[j];
        while (A[ord[pt + 1]] * 2 <= A[i]) pt++, upd(lst[g[ord[pt]]]);
        if (j != lst[g[i]]) continue;
        ret = (ret + get(j)) % md;
    }
    printf("%d\n", ret);
    return 0;
}

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

fish.cpp: In function 'int main()':
fish.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%d%d%d", &n, &k, &md);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d%d", &A[i], &g[i]), ord[i] = i;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• 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