Submission #465595

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
465595	2021-08-16 13:28:22	mariowong	Financial Report (JOI21_financial)	C++14	19 / 100	317 ms	12032 KiB

Main

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>
 
using namespace std;
int n,d,ct,a[300005],seg[1200005],ans,now;
deque <int> dq;
vector <pair<int,int>  > v; 
void update(int id,int l,int r,int pos,int v){
  if (l == r)
  seg[id]=v;
  else
  {
    int mid=(l+r)/2;
    if (pos <= mid) update(id*2,l,mid,pos,v);
    else update(id*2+1,mid+1,r,pos,v);  
    seg[id]=max(seg[id*2],seg[id*2+1]);
  }
}
int query(int id,int l,int r,int x,int y){
  if (x <= l && y >= r)
  return seg[id];
  if (l > y || r < x)
  return -1;
  int mid=(l+r)/2;
  return max(query(id*2,l,mid,x,y),query(id*2+1,mid+1,r,x,y));
}
int main(){
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> n >> d;
  for (int i=1;i<=n;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 5 / 5
• Subtask 6: 0 / 35