oj.uz

답안 #1071339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071339 2024-08-23T06:47:38 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 40056 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< pair<int, int> >v;
        for( int i = l; i <= r; ++i )
            v.pb({a[i], i - l});
        sort(v.begin(), v.end());
        for( int i = 0; i < sz(v) - 1; ++i )
            if( v[i].F + v[i + 1].F > k && v[i].S > v[i + 1].S )
            {
                cout <<0 <<nl;
                ch = true;
                break;
            }
        if( !ch )
            cout <<1 <<nl;
    }
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:33:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for( int i = 0; i < sz(v) - 1; ++i )
      |                         ~~^~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -