oj.uz

Submission #336219

# Submission time Handle Problem Language Result Execution time Memory
336219 2020-12-15T02:58:12 Z Kerim Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 1139 ms 60268 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];
void upd(int x,int val){
	for(;x;x-=x&(-x))
		umax(F[x],val);	
}
int tap(int x){
	int res=0;
	for(;x<MAXN;x+=x&(-x))
		umax(res,F[x]);
	return res;
}
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())
			upd(st.top(),arr[st.top()]+arr[i]);
		tr(it,adj[i])
			if(tap(it->ff)<=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:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
sortbooks.cpp:37:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~
sortbooks.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |   scanf("%d%d%d",&l,&r,&k[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 14 ms 23788 KB Output is correct
3 Correct 14 ms 23788 KB Output is correct
4 Correct 17 ms 23788 KB Output is correct
5 Correct 14 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 14 ms 23916 KB Output is correct
8 Correct 14 ms 23788 KB Output is correct
9 Correct 15 ms 23788 KB Output is correct
10 Correct 14 ms 23788 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 14 ms 23788 KB Output is correct
3 Correct 14 ms 23788 KB Output is correct
4 Correct 17 ms 23788 KB Output is correct
5 Correct 14 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 14 ms 23916 KB Output is correct
8 Correct 14 ms 23788 KB Output is correct
9 Correct 15 ms 23788 KB Output is correct
10 Correct 14 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 24044 KB Output is correct
15 Correct 18 ms 24044 KB Output is correct
16 Correct 17 ms 24044 KB Output is correct
17 Correct 17 ms 24044 KB Output is correct
18 Correct 17 ms 24044 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1110 ms 57348 KB Output is correct
2 Correct 1091 ms 57836 KB Output is correct
3 Correct 1095 ms 57580 KB Output is correct
4 Correct 1085 ms 57608 KB Output is correct
5 Correct 1010 ms 57452 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 27500 KB Output is correct
2 Correct 77 ms 26988 KB Output is correct
3 Correct 79 ms 26860 KB Output is correct
4 Correct 84 ms 27116 KB Output is correct
5 Correct 79 ms 27116 KB Output is correct
6 Correct 67 ms 26092 KB Output is correct
7 Correct 68 ms 25964 KB Output is correct
8 Correct 78 ms 26980 KB Output is correct
9 Correct 56 ms 25828 KB Output is correct
10 Correct 76 ms 26980 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 14 ms 23788 KB Output is correct
3 Correct 14 ms 23788 KB Output is correct
4 Correct 17 ms 23788 KB Output is correct
5 Correct 14 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 14 ms 23916 KB Output is correct
8 Correct 14 ms 23788 KB Output is correct
9 Correct 15 ms 23788 KB Output is correct
10 Correct 14 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 24044 KB Output is correct
15 Correct 18 ms 24044 KB Output is correct
16 Correct 17 ms 24044 KB Output is correct
17 Correct 17 ms 24044 KB Output is correct
18 Correct 17 ms 24044 KB Output is correct
19 Correct 196 ms 31856 KB Output is correct
20 Correct 200 ms 31928 KB Output is correct
21 Correct 164 ms 30572 KB Output is correct
22 Correct 162 ms 30572 KB Output is correct
23 Correct 167 ms 30572 KB Output is correct
24 Correct 146 ms 29548 KB Output is correct
25 Correct 148 ms 29548 KB Output is correct
26 Correct 163 ms 30188 KB Output is correct
27 Correct 165 ms 30316 KB Output is correct
28 Correct 167 ms 30444 KB Output is correct
29 Correct 178 ms 31048 KB Output is correct
30 Correct 183 ms 31084 KB Output is correct
31 Correct 177 ms 30956 KB Output is correct
32 Correct 177 ms 30956 KB Output is correct
33 Correct 179 ms 31084 KB Output is correct
34 Correct 140 ms 29292 KB Output is correct
35 Correct 142 ms 29164 KB Output is correct
36 Correct 142 ms 29036 KB Output is correct
37 Correct 140 ms 28908 KB Output is correct
38 Correct 147 ms 29164 KB Output is correct
39 Correct 163 ms 30180 KB Output is correct
40 Correct 141 ms 29408 KB Output is correct
41 Correct 159 ms 30048 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 14 ms 23788 KB Output is correct
3 Correct 14 ms 23788 KB Output is correct
4 Correct 17 ms 23788 KB Output is correct
5 Correct 14 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 14 ms 23916 KB Output is correct
8 Correct 14 ms 23788 KB Output is correct
9 Correct 15 ms 23788 KB Output is correct
10 Correct 14 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 24044 KB Output is correct
15 Correct 18 ms 24044 KB Output is correct
16 Correct 17 ms 24044 KB Output is correct
17 Correct 17 ms 24044 KB Output is correct
18 Correct 17 ms 24044 KB Output is correct
19 Correct 1110 ms 57348 KB Output is correct
20 Correct 1091 ms 57836 KB Output is correct
21 Correct 1095 ms 57580 KB Output is correct
22 Correct 1085 ms 57608 KB Output is correct
23 Correct 1010 ms 57452 KB Output is correct
24 Correct 94 ms 27500 KB Output is correct
25 Correct 77 ms 26988 KB Output is correct
26 Correct 79 ms 26860 KB Output is correct
27 Correct 84 ms 27116 KB Output is correct
28 Correct 79 ms 27116 KB Output is correct
29 Correct 67 ms 26092 KB Output is correct
30 Correct 68 ms 25964 KB Output is correct
31 Correct 78 ms 26980 KB Output is correct
32 Correct 56 ms 25828 KB Output is correct
33 Correct 76 ms 26980 KB Output is correct
34 Correct 196 ms 31856 KB Output is correct
35 Correct 200 ms 31928 KB Output is correct
36 Correct 164 ms 30572 KB Output is correct
37 Correct 162 ms 30572 KB Output is correct
38 Correct 167 ms 30572 KB Output is correct
39 Correct 146 ms 29548 KB Output is correct
40 Correct 148 ms 29548 KB Output is correct
41 Correct 163 ms 30188 KB Output is correct
42 Correct 165 ms 30316 KB Output is correct
43 Correct 167 ms 30444 KB Output is correct
44 Correct 178 ms 31048 KB Output is correct
45 Correct 183 ms 31084 KB Output is correct
46 Correct 177 ms 30956 KB Output is correct
47 Correct 177 ms 30956 KB Output is correct
48 Correct 179 ms 31084 KB Output is correct
49 Correct 140 ms 29292 KB Output is correct
50 Correct 142 ms 29164 KB Output is correct
51 Correct 142 ms 29036 KB Output is correct
52 Correct 140 ms 28908 KB Output is correct
53 Correct 147 ms 29164 KB Output is correct
54 Correct 163 ms 30180 KB Output is correct
55 Correct 141 ms 29408 KB Output is correct
56 Correct 159 ms 30048 KB Output is correct
57 Correct 1116 ms 60176 KB Output is correct
58 Correct 1139 ms 60268 KB Output is correct
59 Correct 1074 ms 57456 KB Output is correct
60 Correct 1101 ms 57508 KB Output is correct
61 Correct 1065 ms 57544 KB Output is correct
62 Correct 1057 ms 57708 KB Output is correct
63 Correct 749 ms 50028 KB Output is correct
64 Correct 712 ms 50028 KB Output is correct
65 Correct 963 ms 53532 KB Output is correct
66 Correct 933 ms 53484 KB Output is correct
67 Correct 936 ms 53484 KB Output is correct
68 Correct 984 ms 56428 KB Output is correct
69 Correct 994 ms 56684 KB Output is correct
70 Correct 1002 ms 55756 KB Output is correct
71 Correct 1000 ms 56028 KB Output is correct
72 Correct 998 ms 55916 KB Output is correct
73 Correct 666 ms 48492 KB Output is correct
74 Correct 684 ms 48620 KB Output is correct
75 Correct 680 ms 48488 KB Output is correct
76 Correct 678 ms 48532 KB Output is correct
77 Correct 685 ms 48364 KB Output is correct
78 Correct 893 ms 56024 KB Output is correct
79 Correct 716 ms 50440 KB Output is correct
80 Correct 889 ms 54868 KB Output is correct