Submission #789718

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
789718	2023-07-21 20:35:12	IBory	역사적 조사 (JOI14_historical)	C++17	40 / 100	4078 ms	14024 KiB

historic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;
const int MAX = 123456, SQ = 8;
ll X[MAX], ans[MAX], cnt[MAX], S[MAX];
multiset<ll> cand[MAX >> SQ];
struct Query {
  int s, e, id;
  Query(int a = 0, int b = 0, int c = 0) {
    s = a, e = b, id = c;
  }
  const bool operator<(Query& a) {
    if ((s >> SQ) != (a.s >> SQ)) return (s >> SQ) < (a.s >> SQ);
    return e > a.e;
  }
} QS[MAX];
void Add(int idx) {
  int n = S[idx];
  if (cnt[n]) cand[n >> SQ].erase(cand[n >> SQ].find(X[n] * cnt[n]));
  cand[n >> SQ].insert(X[n] * (++cnt[n]));
}
void Sub(int idx) {
  int n = S[idx];
  cand[n >> SQ].erase(cand[n >> SQ].find(X[n] * cnt[n]));
  if (--cnt[n]) cand[n >> SQ].insert(X[n] * cnt[n]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 0 / 60