oj.uz

답안 #1094880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094880 2024-09-30T17:51:12 Z Kerim Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 80468 KB 
#include "bits/stdc++.h"
#define MAXN 1000009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;
 
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int F[MAXN],arr[MAXN],k[MAXN],ans[MAXN];
vector<PII>adj[MAXN];
int main(){
    // freopen("file.in", "r", stdin);
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)
        scanf("%d",arr+i);
    for(int i=1;i<=q;i++){
        int l,r;
        scanf("%d%d%d",&l,&r,&k[i]);
        adj[r].pb(mp(l,i)); 
    }
    stack<int>st;
    for(int i=1;i<=n;i++){
        while(!st.empty() and arr[st.top()]<=arr[i])
            st.pop();
        if(!st.empty())
            F[st.top()] = max(F[st.top()], arr[i]+arr[st.top()]);
        tr(it,adj[i]){
            int mx = 0;
            for (int j = it->ff; j <= n; j++)
                mx = max(mx, F[j]);
            if(mx<=k[it->ss])
                ans[it->ss]=1;
        }
        st.push(i);
    }
    for(int i=1;i<=q;i++)
        printf("%d\n",ans[i]);
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
sortbooks.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         scanf("%d",arr+i);
      |         ~~~~~^~~~~~~~~~~~
sortbooks.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d%d%d",&l,&r,&k[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24152 KB Output is correct
2 Correct 9 ms 23900 KB Output is correct
3 Correct 9 ms 23788 KB Output is correct
4 Correct 9 ms 23900 KB Output is correct
5 Correct 9 ms 24152 KB Output is correct
6 Correct 9 ms 23824 KB Output is correct
7 Correct 10 ms 23900 KB Output is correct
8 Correct 9 ms 23960 KB Output is correct
9 Correct 9 ms 23900 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 12 ms 23900 KB Output is correct
12 Correct 16 ms 24156 KB Output is correct
13 Correct 16 ms 24156 KB Output is correct
14 Correct 22 ms 24272 KB Output is correct
15 Correct 22 ms 24152 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 23 ms 24152 KB Output is correct
18 Correct 25 ms 24156 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24152 KB Output is correct
2 Correct 9 ms 23900 KB Output is correct
3 Correct 9 ms 23788 KB Output is correct
4 Correct 9 ms 23900 KB Output is correct
5 Correct 9 ms 24152 KB Output is correct
6 Correct 9 ms 23824 KB Output is correct
7 Correct 10 ms 23900 KB Output is correct
8 Correct 9 ms 23960 KB Output is correct
9 Correct 9 ms 23900 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 12 ms 23900 KB Output is correct
12 Correct 16 ms 24156 KB Output is correct
13 Correct 16 ms 24156 KB Output is correct
14 Correct 22 ms 24272 KB Output is correct
15 Correct 22 ms 24152 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 23 ms 24152 KB Output is correct
18 Correct 25 ms 24156 KB Output is correct
19 Execution timed out 3073 ms 36384 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24152 KB Output is correct
2 Correct 9 ms 23900 KB Output is correct
3 Correct 9 ms 23788 KB Output is correct
4 Correct 9 ms 23900 KB Output is correct
5 Correct 9 ms 24152 KB Output is correct
6 Correct 9 ms 23824 KB Output is correct
7 Correct 10 ms 23900 KB Output is correct
8 Correct 9 ms 23960 KB Output is correct
9 Correct 9 ms 23900 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 12 ms 23900 KB Output is correct
12 Correct 16 ms 24156 KB Output is correct
13 Correct 16 ms 24156 KB Output is correct
14 Correct 22 ms 24272 KB Output is correct
15 Correct 22 ms 24152 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 23 ms 24152 KB Output is correct
18 Correct 25 ms 24156 KB Output is correct
19 Execution timed out 3036 ms 80468 KB Time limit exceeded
20 Halted 0 ms 0 KB -