Submission #1130069

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1130069	2024-12-27 03:58:09	Math4Life2020	Two Currencies (JOI23_currencies)	C++20	38 / 100	5138 ms	1008084 KiB

currencies

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
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>;
const int Nm = 1e5+5; const int E = 17;
const int INF = 1e9;
struct Node {
  //map<ll,ll> m0; //cost->number
  //map<ll,pii> mps; //aggregate: cost -> {# <=cost, val <=cost}
  //vector<pair<int,int>> m0;
  vector<pair<pair<int,int>,long long>> mps;
  int ncp = 0;
  bool brk = 0;
  void prc(vector<pair<int,int>> m0) {
    int n0=0; long long v0=0;
    //mps[-INF]={0,0};
    mps.push_back({{-INF,0},0LL});
    for (pair<int,int> p0: m0) {
      long long c1 = p0.first; int n1 = p0.second;
      n0+=n1; v0+=c1*n1;
      //mps[c1]={n0,v0};
      mps.push_back({{c1,n0},v0});
    }
  }
  vector<pair<int,int>> getm0() {
    vector<pair<int,int>> vf;
    int ntot = 0;
    long long vtot = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 28 / 28
• Subtask 3: 0 / 30
• Subtask 4: 0 / 32