oj.uz

Submission #649580

# Submission time Handle Problem Language Result Execution time Memory
649580 2022-10-10T18:49:09 Z murad_2005 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 403 ms 10132 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ui unsigned int
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pil pair<int, ll>
#define plli pair<long long, int>
#define pdi pair<double, int>
#define pldldi pair<ld, pair<ld, int>>
#define pdd pair<double, double>
#define pid pair<int, double>
#define piii pair<int, pair<int, int>>
#define pllll pair<long long, long long>
#define pllllll pair<ll, pllll>
#define INF 2e9 + 5
#define size(v) v.size()
#define f first
#define s second
#define Pi 3.14159265359

using namespace std;

void Subtask1and2(int n, int m, vector<int>&a){
    while(m--){
        int l, r, k, flag = 0;
        cin >> l >> r >> k;
        vector<int>v;
        for(int i = l; i <= r; i++){
            v.pb(a[i]);
        }
        int Max = -INF;
        for(int i = 0; i < size(v); i++){
            Max = max(Max, v[i]);
            if(i > 0){
                if(Max > v[i] && Max + v[i] > k){
                    flag = 1;
                    break;
                }
            }
        }
        cout << (flag ^ 1) << "\n";
    }
}

void Subtask3(int n, int m, vector<int>&a){
    vector<int>pos(n + 1, 0);
    for(int i = 2; i <= n; i++){
        if(a[i] < a[i - 1]){
            pos[i] = 1;
        }
    }
    for(int i = 2; i <= n; i++){
        pos[i] += pos[i - 1];
    }
    while(m--){
        int l, r, k;
        cin >> l >> r >> k;
        int Sum = pos[r] - pos[l - 1];
        if(Sum > 0){
            cout << "0\n";
        }else{
            cout << "1\n";
        }
    }
}

void solve(){
    int n, m;
    cin >> n >> m;
    vector<int>a(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if(n <= 5000 && m <= 5000){
        Subtask1and2(n, m, a);
    }else{
        Subtask3(n, m, a);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'void Subtask1and2(int, int, std::vector<int>&)':
sortbooks.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int i = 0; i < size(v); i++){
      |                          ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 19 ms 396 KB Output is correct
13 Correct 22 ms 404 KB Output is correct
14 Correct 35 ms 388 KB Output is correct
15 Correct 38 ms 340 KB Output is correct
16 Correct 117 ms 448 KB Output is correct
17 Correct 106 ms 360 KB Output is correct
18 Correct 107 ms 400 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 403 ms 10132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 1240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 19 ms 396 KB Output is correct
13 Correct 22 ms 404 KB Output is correct
14 Correct 35 ms 388 KB Output is correct
15 Correct 38 ms 340 KB Output is correct
16 Correct 117 ms 448 KB Output is correct
17 Correct 106 ms 360 KB Output is correct
18 Correct 107 ms 400 KB Output is correct
19 Incorrect 89 ms 2224 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 19 ms 396 KB Output is correct
13 Correct 22 ms 404 KB Output is correct
14 Correct 35 ms 388 KB Output is correct
15 Correct 38 ms 340 KB Output is correct
16 Correct 117 ms 448 KB Output is correct
17 Correct 106 ms 360 KB Output is correct
18 Correct 107 ms 400 KB Output is correct
19 Incorrect 403 ms 10132 KB Output isn't correct
20 Halted 0 ms 0 KB -