oj.uz

Submission #1071359

# Submission time Handle Problem Language Result Execution time Memory
1071359 2024-08-23T06:53:43 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 31312 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define sz(x) x.size()
#define nl '\n'
#define F first
#define S second

const int N = 1e6 + 1;
const int inf = 1e18;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, q;
    cin >>n >>q;
    int a[n + 1];
    for( int i = 1; i <= n; ++i )
        cin >>a[i];
    while( q-- )
    {
        int l, r, k;
        bool ch = false;
        cin >>l >>r >>k;
        vector< int >v;
        for( int i = l; i <= r; ++i )
            v.pb( a[i] );
        int s[sz(v) + 1];
        s[sz(v)] = 0;
        for( int i = sz(v) - 1; i >= 0; --i )
        {
            s[i] = max(s[i + 1], v[i]);
            if( i < sz(v) - 1 && s[i + 1] < v[i] && s[i + 1] + v[i] > k )
                ch = true;
        }
        cout <<(ch ? 0 : 1) <<nl;
    }
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:37:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             if( i < sz(v) - 1 && s[i + 1] < v[i] && s[i + 1] + v[i] > k )
      |                 ~~^~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3042 ms 31312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3044 ms 3864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -