제출 #1164774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164774		King87arshia	Izbori (COCI22_izbori)	C++20	25 / 110	3097 ms	19000 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC target ("avx2")

const int N = 2e5 + 5, T = 1897;

vector<long long> big;
long long ans = 0, n, a[N];
map<long long, long long> mp;

int main() {
    scanf("%lld", &n);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
        mp[a[i]]++;
    }
    for (auto &[x, y] : mp)
        if (y >= T)
            big.push_back(x);
    ordered_set s;
    for (long long x : big) {
        vector<long long> fake(n + 5, 0);
        long long sum = 0;
        for (int i = 0; i < n; i++)
            fake[i] = (a[i] == x ? 1 : -1);
        s.insert({0, -1});
        for (int i = 0; i < n; i++) {
            sum += fake[i];
            ans += i + 1 - s.order_of_key({sum, INT_MIN});
            s.insert({sum, i});
        }
    }
    for (int i = 0; i < n; i++) {
        long long mx = 0;
        mp.clear();
        for (int sz = 1; sz <= 2 * T; sz++) {
            if (i + sz - 1 >= n)
                break;
            mp[a[i + sz - 1]]++;
            mx = max(mx, mp[a[i + sz - 1]]);
            if (mx > sz / 2) {
                ans++;
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
Main.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%lld", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 70