oj.uz

답안 #1116368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116368 2024-11-21T14:31:12 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 27656 KB 
#include <bits/stdc++.h> 
using namespace std;
#define pb push_back 
#define sz size() 
#define in insert 
#define int long long 
#define F first 
#define up upper_bound 
#define S second 
#define lb lower_bound 
#define pair pair<int, int> 
#define all(v) v.begin(),v.end() 
#define FOR1(x, n) for(int j = x; j <= n; j ++) 
#define FOR(x, n) for(int i = x; i <= n; i ++) 
#define FORR(x, n) for(int j = x; j >= n; j --) 
#define nikita ios_base::sync_with_stdio(0), cin.tie(0); 
int n,m,k,t,sum=0,cnt, l,ans = 0, r, x, y, q; 
const int N = 2e5+5;
set<int>g[N]; 
int a[N], b[N];
bool f;
void solve() { 
    nikita
    cin >> n >> m;
    FOR(1, n)cin >> a[i];
    l = 1;
    FOR(1, m){
        cin >> l >> r >> k;
        f=0;
        set<int, greater<int>>st;
        st.in(a[r]);
        st.in(0);
        bool hi = 0;
        FORR(r-1, l){
            if(!a[j])hi = 1;
            if(a[j] != 0)x = *st.up(a[j]);
            else continue;
            st.in(a[j]);
            if(!x && !hi)continue;
            if(x + a[j] > k){
                f = 1;
                break;
            }
        }
        if(f)cout << "0\n";
        else cout << "1\n";
    }
}
signed main() { 
    nikita 
    int t=1; 
    FOR(1, t)solve(); 
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 3 ms 12624 KB Output is correct
3 Correct 3 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 3 ms 12624 KB Output is correct
6 Correct 3 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 9 ms 12624 KB Output is correct
9 Correct 5 ms 12624 KB Output is correct
10 Correct 4 ms 12792 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 3 ms 12624 KB Output is correct
3 Correct 3 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 3 ms 12624 KB Output is correct
6 Correct 3 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 9 ms 12624 KB Output is correct
9 Correct 5 ms 12624 KB Output is correct
10 Correct 4 ms 12792 KB Output is correct
11 Correct 7 ms 12880 KB Output is correct
12 Correct 7 ms 12880 KB Output is correct
13 Correct 8 ms 12880 KB Output is correct
14 Correct 11 ms 13304 KB Output is correct
15 Correct 9 ms 12880 KB Output is correct
16 Correct 955 ms 13136 KB Output is correct
17 Correct 593 ms 13096 KB Output is correct
18 Correct 130 ms 12880 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 388 ms 27656 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 3 ms 12624 KB Output is correct
3 Correct 3 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 3 ms 12624 KB Output is correct
6 Correct 3 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 9 ms 12624 KB Output is correct
9 Correct 5 ms 12624 KB Output is correct
10 Correct 4 ms 12792 KB Output is correct
11 Correct 7 ms 12880 KB Output is correct
12 Correct 7 ms 12880 KB Output is correct
13 Correct 8 ms 12880 KB Output is correct
14 Correct 11 ms 13304 KB Output is correct
15 Correct 9 ms 12880 KB Output is correct
16 Correct 955 ms 13136 KB Output is correct
17 Correct 593 ms 13096 KB Output is correct
18 Correct 130 ms 12880 KB Output is correct
19 Execution timed out 3033 ms 23624 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 3 ms 12624 KB Output is correct
3 Correct 3 ms 12624 KB Output is correct
4 Correct 2 ms 12624 KB Output is correct
5 Correct 3 ms 12624 KB Output is correct
6 Correct 3 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 9 ms 12624 KB Output is correct
9 Correct 5 ms 12624 KB Output is correct
10 Correct 4 ms 12792 KB Output is correct
11 Correct 7 ms 12880 KB Output is correct
12 Correct 7 ms 12880 KB Output is correct
13 Correct 8 ms 12880 KB Output is correct
14 Correct 11 ms 13304 KB Output is correct
15 Correct 9 ms 12880 KB Output is correct
16 Correct 955 ms 13136 KB Output is correct
17 Correct 593 ms 13096 KB Output is correct
18 Correct 130 ms 12880 KB Output is correct
19 Runtime error 388 ms 27656 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -