oj.uz

답안 #1115161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115161 2024-11-20T07:27:17 Z elush Bitaro, who Leaps through Time (JOI19_timeleap) C++14
4 / 100
 3000 ms 25168 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmax(a, b) a = max(a, b)
#define chkmin(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;

const int block = 600;
const int MAX_N = 3e5 + 5;

pii dpl[MAX_N], dpr[MAX_N];
vii optl[MAX_N], optr[MAX_N];

void Update(int l, int r) {

}

int Query(int l, int r) {

}

int L[MAX_N], R[MAX_N], t[MAX_N], a[MAX_N], b[MAX_N], c[MAX_N], d[MAX_N];
int l[MAX_N], r[MAX_N];

int main() {
    int n, q;
    cin >> n >> q;
    for (int i = 0; i + 1 < n; i++) cin >> L[i] >> R[i];
    for (int i = 0; i < q; i++) {
        cin >> t[i] >> a[i] >> b[i] >> c[i];
        if (t[i] == 2) cin >> d[i];
    }
    for (int i = 0; i < q; i++) a[i]--, c[i]--;
    for (int i = 0; i < n; i++) R[i]--;
    for (int i = 0; i < n; i++) l[i] = L[i], r[i] = R[i];
    for (int i = 0; i < q; i++) {
        if (t[i] == 1) {
            l[a[i]] = b[i], r[a[i]] = c[i];
            continue;
        }
        if (a[i] <= c[i]) {
            ll ti = b[i], ans = 0;
            for (int j = a[i]; j < c[i]; j++) {
                if (ti < l[j]) ti = l[j];
                else if (ti > r[j]) ans += ti - r[j], ti = r[j];
                ti++;
            }
            ans += max<ll>(0, ti - d[i]);
            cout << ans << '\n';
        } else {
            ll ti = b[i], ans = 0;
            for (int j = a[i] - 1; j >= c[i]; j--) {
                if (ti < l[j]) ti = l[j];
                else if (ti >= r[j]) ans += ti - r[j], ti = r[j];
                ti++;
            }
            ans += max<ll>(0, ti - d[i]);
            cout << ans << '\n';
        }
    }

}

Compilation message

timeleap.cpp: In function 'int Query(int, int)':
timeleap.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
   26 | }
      | ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 24912 KB Output is correct
2 Correct 5 ms 24912 KB Output is correct
3 Correct 5 ms 25012 KB Output is correct
4 Correct 4 ms 24912 KB Output is correct
5 Correct 4 ms 24912 KB Output is correct
6 Correct 4 ms 24912 KB Output is correct
7 Correct 4 ms 24912 KB Output is correct
8 Correct 4 ms 24912 KB Output is correct
9 Correct 5 ms 24912 KB Output is correct
10 Correct 4 ms 24912 KB Output is correct
11 Correct 6 ms 24964 KB Output is correct
12 Correct 5 ms 24912 KB Output is correct
13 Correct 5 ms 24912 KB Output is correct
14 Correct 6 ms 24912 KB Output is correct
15 Correct 8 ms 24912 KB Output is correct
16 Correct 7 ms 24912 KB Output is correct
17 Correct 6 ms 24912 KB Output is correct
18 Correct 6 ms 24912 KB Output is correct
19 Correct 6 ms 24912 KB Output is correct
20 Correct 5 ms 25052 KB Output is correct
21 Correct 6 ms 24912 KB Output is correct
22 Correct 6 ms 24912 KB Output is correct
23 Correct 7 ms 24912 KB Output is correct
24 Correct 6 ms 24912 KB Output is correct
25 Correct 6 ms 24912 KB Output is correct
26 Correct 6 ms 24912 KB Output is correct
27 Correct 6 ms 24912 KB Output is correct
28 Correct 6 ms 24912 KB Output is correct
29 Correct 6 ms 24912 KB Output is correct
30 Correct 6 ms 24912 KB Output is correct
31 Correct 6 ms 25084 KB Output is correct
32 Correct 6 ms 24912 KB Output is correct
33 Correct 6 ms 24964 KB Output is correct
34 Correct 5 ms 24912 KB Output is correct
35 Correct 6 ms 24912 KB Output is correct
36 Correct 8 ms 25168 KB Output is correct
37 Correct 7 ms 24912 KB Output is correct
38 Correct 7 ms 24912 KB Output is correct
39 Correct 6 ms 24912 KB Output is correct
40 Correct 6 ms 24912 KB Output is correct
41 Correct 5 ms 14784 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3053 ms 24964 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 24912 KB Output is correct
2 Correct 5 ms 24912 KB Output is correct
3 Correct 5 ms 25012 KB Output is correct
4 Correct 4 ms 24912 KB Output is correct
5 Correct 4 ms 24912 KB Output is correct
6 Correct 4 ms 24912 KB Output is correct
7 Correct 4 ms 24912 KB Output is correct
8 Correct 4 ms 24912 KB Output is correct
9 Correct 5 ms 24912 KB Output is correct
10 Correct 4 ms 24912 KB Output is correct
11 Correct 6 ms 24964 KB Output is correct
12 Correct 5 ms 24912 KB Output is correct
13 Correct 5 ms 24912 KB Output is correct
14 Correct 6 ms 24912 KB Output is correct
15 Correct 8 ms 24912 KB Output is correct
16 Correct 7 ms 24912 KB Output is correct
17 Correct 6 ms 24912 KB Output is correct
18 Correct 6 ms 24912 KB Output is correct
19 Correct 6 ms 24912 KB Output is correct
20 Correct 5 ms 25052 KB Output is correct
21 Correct 6 ms 24912 KB Output is correct
22 Correct 6 ms 24912 KB Output is correct
23 Correct 7 ms 24912 KB Output is correct
24 Correct 6 ms 24912 KB Output is correct
25 Correct 6 ms 24912 KB Output is correct
26 Correct 6 ms 24912 KB Output is correct
27 Correct 6 ms 24912 KB Output is correct
28 Correct 6 ms 24912 KB Output is correct
29 Correct 6 ms 24912 KB Output is correct
30 Correct 6 ms 24912 KB Output is correct
31 Correct 6 ms 25084 KB Output is correct
32 Correct 6 ms 24912 KB Output is correct
33 Correct 6 ms 24964 KB Output is correct
34 Correct 5 ms 24912 KB Output is correct
35 Correct 6 ms 24912 KB Output is correct
36 Correct 8 ms 25168 KB Output is correct
37 Correct 7 ms 24912 KB Output is correct
38 Correct 7 ms 24912 KB Output is correct
39 Correct 6 ms 24912 KB Output is correct
40 Correct 6 ms 24912 KB Output is correct
41 Correct 5 ms 14784 KB Output is correct
42 Execution timed out 3053 ms 24964 KB Time limit exceeded
43 Halted 0 ms 0 KB -