Submission #421156

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
421156	2021-06-08 19:28:21	Jasiekstrz	Rainforest Jumps (APIO21_jumps)	C++17	23 / 100	4003 ms	240064 KiB

jumps

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 "jumps.h"
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int NN=2e5;
const int PP=27e4;
const int L=18;
int n;
int tab[NN+10];
int e[NN+10][2];
int jb[NN+10][L+2];
int js[NN+10][L+2];
int pot;
set<pair<int,int>> tree[2*PP+10];
void upd_ans(int &ans,int i,int c)
{
  auto it=tree[i].upper_bound({c,n+10});
  if(it!=tree[i].begin() && (ans==-1 || prev(it)->fi>tab[ans]))
    ans=prev(it)->se;
  return;
}
int read_t(int l,int r,int c) // largest <=c
{
  int ans=-1;
  for(l+=pot-1,r+=pot-1;l<=r;l/=2,r/=2)
  {
    if(l%2==1)
      upd_ans(ans,l++,c);
    if(r%2==0)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

jumps.cpp:92:2: warning: #warning C==D [-Wcpp]
   92 | #warning C==D
      |  ^~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 23 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19