Submission #976499

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
976499	2024-05-06 15:46:19	LaviniaTornaghi	Quality Of Living (IOI10_quality)	C++14	20 / 100	7 ms	4956 KiB

quality

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;
#include "grader.h"
struct SegTree{
  int tmp=1, target, MAXN;
  vector<int> tree;
  void init(int a, int b){
    target = a; MAXN=b;
    while(tmp<=MAXN) tmp*=2;
    tree.resize(2*tmp);
  }
  void update(int p, int d){
    tree[p+tmp]+=d;
    p=(p+tmp)/2; 
    while(p){
      tree[p]=tree[p*2]+tree[p*2+1];
      p/=2;
    }
  }
  int query(){ return query(1,0,tmp-1,0);}
  int query(int i, int l, int r, int sl){ 
    if(l==r) return i-tmp;
    int m = (l+r)/2;
    if(sl+tree[i*2]>target)return query(i*2,l,m,sl);
    else return query(i*2+1,m+1,r,sl+tree[i*2]);
  }
};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20