제출 #1163553

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1163553	2025-03-08 08:30:53	emptypringlescan	Specijacija (COCI20_specijacija)	C++20	0 / 110	528 ms	181852 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;
const long long buc=450;
long long arr[200005],lvl[200005],bruh[200005];
vector<int> seg[450+5],snap[450+5];
int inc1(int d, int l){
  assert(d>0);
  if(lvl[d-1]<l) return l-1;
  else return l;
}
int incbuc(int d, int l){
  assert(d%buc==0);
  int b=d/buc-1;
  return snap[b][l];
}
int32_t main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,q,t;
    cin >> n >> q >> t;
    for(int i=0; i<n; i++){
    cin >> arr[i];
    lvl[i]=arr[i]-(long long)i*(i+1)/2ll;
    bruh[i]=(long long)i*(i+1)/2ll;
  }
  bruh[n]=(long long)n*(n+1)/2ll;
  for(int i=0; i<n/buc; i++){
    int st=i*buc,en=min((i+1)*buc-1,(long long)n-1);
    int cur=0;
    for(int j=1; j<=st+1; j++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 30
• Subtask 4: 0 / 60