oj.uz

Submission #1094882

# Submission time Handle Problem Language Result Execution time Memory
1094882 2024-09-30T17:53:16 Z Kerim Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 81820 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];
int d[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)); 
    }
    for(int i=1;i<=n;i++){
        d[i] = -1;
        for (int j = i; j >= 1; j--)
            if (arr[j] > arr[i]){
                d[i] = j;
                break;
            }
        if(~d[i])
            F[d[i]] = max(F[d[i]], arr[i]+arr[d[i]]);
        tr(it,adj[i]){
            int mx = 0;
            for (int j = it->ff; j <= i; j++)
                mx = max(mx, F[j]);
            ans[it->ss]=mx<=k[it->ss];
        }
    }
    for(int i=1;i<=q;i++)
        printf("%d\n",ans[i]);
    return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 10 ms 23960 KB Output is correct
3 Correct 10 ms 23900 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 10 ms 23900 KB Output is correct
6 Correct 10 ms 23796 KB Output is correct
7 Correct 11 ms 23896 KB Output is correct
8 Correct 11 ms 24152 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 11 ms 23868 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 10 ms 23960 KB Output is correct
3 Correct 10 ms 23900 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 10 ms 23900 KB Output is correct
6 Correct 10 ms 23796 KB Output is correct
7 Correct 11 ms 23896 KB Output is correct
8 Correct 11 ms 24152 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 11 ms 23868 KB Output is correct
11 Correct 13 ms 23900 KB Output is correct
12 Correct 15 ms 24156 KB Output is correct
13 Correct 18 ms 24156 KB Output is correct
14 Correct 17 ms 24156 KB Output is correct
15 Correct 17 ms 24196 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 25 ms 24156 KB Output is correct
18 Correct 24 ms 24156 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1687 ms 29636 KB Output is correct
2 Execution timed out 3072 ms 29012 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 10 ms 23960 KB Output is correct
3 Correct 10 ms 23900 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 10 ms 23900 KB Output is correct
6 Correct 10 ms 23796 KB Output is correct
7 Correct 11 ms 23896 KB Output is correct
8 Correct 11 ms 24152 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 11 ms 23868 KB Output is correct
11 Correct 13 ms 23900 KB Output is correct
12 Correct 15 ms 24156 KB Output is correct
13 Correct 18 ms 24156 KB Output is correct
14 Correct 17 ms 24156 KB Output is correct
15 Correct 17 ms 24196 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 25 ms 24156 KB Output is correct
18 Correct 24 ms 24156 KB Output is correct
19 Execution timed out 3066 ms 36724 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 10 ms 23960 KB Output is correct
3 Correct 10 ms 23900 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 10 ms 23900 KB Output is correct
6 Correct 10 ms 23796 KB Output is correct
7 Correct 11 ms 23896 KB Output is correct
8 Correct 11 ms 24152 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 11 ms 23868 KB Output is correct
11 Correct 13 ms 23900 KB Output is correct
12 Correct 15 ms 24156 KB Output is correct
13 Correct 18 ms 24156 KB Output is correct
14 Correct 17 ms 24156 KB Output is correct
15 Correct 17 ms 24196 KB Output is correct
16 Correct 26 ms 24156 KB Output is correct
17 Correct 25 ms 24156 KB Output is correct
18 Correct 24 ms 24156 KB Output is correct
19 Execution timed out 3031 ms 81820 KB Time limit exceeded
20 Halted 0 ms 0 KB -