Submission #954087

#	Time	Username	Problem	Language	Result	Execution time	Memory
954087		Unforgettablepl	Rainforest Jumps (APIO21_jumps)	C++17	4 / 100	585 ms	49296 KiB

jumps

#include <bits/stdc++.h>
using namespace std;

#define int long long

vector<int> adj[2000001];
int arr[2000001];
int rarr[2000001];
int n;

void init(int32_t N, vector<int32_t> H) {
}

int32_t minimum_jumps(int32_t A, int32_t B, int32_t C, int32_t D) {
    return C-B;
}

//int32_t main() {
//    int32_t N, Q;
//    assert(2 == scanf("%d %d", &N, &Q));
//    std::vector<int32_t> H(N);
//    for (int32_t i = 0; i < N; ++i) {
//        assert(1 == scanf("%d", &H[i]));
//    }
//    init(N, H);
//
//    for (int32_t i = 0; i < Q; ++i) {
//        int32_t A, B, C, D;
//        assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
//        printf("%d\n", minimum_jumps(A, B, C, D));
//    }
//    return 0;
//}

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