Submission #981385

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
981385	2024-05-13 06:45:32	Faisal_Saqib	Rainforest Jumps (APIO21_jumps)	C++17	37 / 100	4054 ms	25784 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>
using namespace std;
const int N=2e5+2;
int dist[N],n,subtask1;
vector<int> adj[N];
void init(int NP, std::vector<int> h) {
  subtask1=is_sorted(begin(h),end(h));
  n=NP;
  set<int> spl;
  vector<pair<int,int>> pp;
  for(int j=0;j<n;j++)
    pp.push_back({h[j],j});
  sort(begin(pp),end(pp));
  for(int j=n-1;j>=0;j--)
  {
    auto it = spl.upper_bound(pp[j].second);
    if(it!=end(spl))
      adj[pp[j].second].push_back(*it);
    if(it!=begin(spl))
      adj[pp[j].second].push_back(*(--it));
    spl.insert(pp[j].second);
  }
}
 
int minimum_jumps(int a, int b, int c, int d) {
  if(subtask1)
    return max(0,c-b);
  for(int j=0;j<=n;j++)
    dist[j]=2e9;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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