Submission #1001937

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1001937	2024-06-19 08:37:46	vjudge1	Liteh and Newfiteh (INOI20_litehfiteh)	C++17	100 / 100	300 ms	252364 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 int N = 1e5+10;
const int LG = 20;
struct node {
  long long mn=0;
  vector<int> dec;
  node() {
    dec=vector<int>(LG, -1);
  }
};
int n, a[N];
node up[N][LG];
node merge(const node &A, const node &B) {
  node res;
  res.mn = min(A.mn, B.mn);
  for(int i = 0;i<LG;i++){
    if(A.dec[i] == -1 or B.dec[i] == -1)continue;
    res.dec[i] = A.dec[i]+B.dec[i];
  }
  if(res.mn > 0) {
    for(int i = 0;i+1<LG;i++){
      if(A.dec[i+1] == -1 or B.dec[i+1]==-1)continue;
      int L = A.dec[i+1];
      int R = B.dec[i+1];
      if(L == -1 or R == -1)continue;
      if(res.dec[i] == -1)res.dec[i] = L+R+1;
      else res.dec[i] = min(res.dec[i], L+R+1);
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70