Submission #903837

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
903837	2024-01-11T12:02:53 Z	qin	Financial Report (JOI21_financial)	C++17	48 / 100	4000 ms	9556 KB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18;
int base = 1;
struct seg{
		vector<pii> t;
		void init(int n){
				while(base < n) base <<= 1;
				t.resize(base<<1);
		}
		void update(int i, int val, int time){
				t[i] = pii(val, time);
		}
		void zero(int time){
				for(int i = 1; i <= base; ++i) if(t[i].se < time) t[i] = pii(0, inf);
		}
		int query(int l, int r){
				int ret = 0;
				for(int i = l; i <= r; ++i) ret = max(t[i].fi, ret);
				return ret;
		}
		void max_time(int l, int r, int time){
				for(int i = l; i <= r; ++i) if(t[i].se < time) t[i].se = time;
		}
};
void answer(){
		int n, d; scanf("%d%d", &n, &d);
		set<int> sc;
		vector<int> t(n+1);
		for(int i = 1; i <= n; ++i) scanf("%d", &t[i]), sc.emplace(t[i]);
		unordered_map<int, int> mp; int it = 0;
		for(int u : sc) mp[u] = ++it;
		for(int i = 1; i <= n; ++i) t[i] = mp[t[i]];
		
		seg seg; seg.init(n);
		int result = 0;
		for(int i = 1; i <= n; ++i){
				int mn = inf, mn_time = 0;
				for(int j = i-1; j >= max(1, i-d); --j) if(t[j] <= mn) mn = t[j], mn_time = j;
				if(mn != inf) seg.max_time(mn, base, mn_time), seg.zero(i-d);
				if(i != n) seg.update(t[i], max(seg.query(1, t[i]-1)+1, seg.query(t[i], t[i])), i);
				else result = max(seg.query(1, t[i]-1)+1, seg.query(t[i], base));
				//~ for(int j = 1; j <= n; ++j) printf("%d %d, ", seg.t[j].fi, seg.t[j].se);
				//~ pn;
		}
		printf("%d\n", result);
}
int main(){
		int T = 1;
		for(++T; --T; ) answer();
		return 0;
}

Compilation message

Main.cpp: In function 'void answer()':
Main.cpp:34:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |   int n, d; scanf("%d%d", &n, &d);
      |             ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:37:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |   for(int i = 1; i <= n; ++i) scanf("%d", &t[i]), sc.emplace(t[i]);
      |                               ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	396 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	360 KB	Output is correct
11	Correct	0 ms	360 KB	Output is correct
12	Correct	1 ms	360 KB	Output is correct
13	Correct	0 ms	360 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	1 ms	360 KB	Output is correct
18	Correct	0 ms	360 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	0 ms	360 KB	Output is correct
21	Correct	1 ms	360 KB	Output is correct
22	Correct	0 ms	360 KB	Output is correct
23	Correct	1 ms	360 KB	Output is correct
24	Correct	1 ms	360 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	0 ms	360 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	396 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	360 KB	Output is correct
11	Correct	0 ms	360 KB	Output is correct
12	Correct	1 ms	360 KB	Output is correct
13	Correct	0 ms	360 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	1 ms	360 KB	Output is correct
18	Correct	0 ms	360 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	0 ms	360 KB	Output is correct
21	Correct	1 ms	360 KB	Output is correct
22	Correct	0 ms	360 KB	Output is correct
23	Correct	1 ms	360 KB	Output is correct
24	Correct	1 ms	360 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	0 ms	360 KB	Output is correct
27	Correct	1 ms	360 KB	Output is correct
28	Correct	1 ms	360 KB	Output is correct
29	Correct	1 ms	444 KB	Output is correct
30	Correct	1 ms	360 KB	Output is correct
31	Correct	1 ms	360 KB	Output is correct
32	Correct	1 ms	360 KB	Output is correct
33	Correct	1 ms	360 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	396 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	360 KB	Output is correct
11	Correct	0 ms	360 KB	Output is correct
12	Correct	1 ms	360 KB	Output is correct
13	Correct	0 ms	360 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	1 ms	360 KB	Output is correct
18	Correct	0 ms	360 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	0 ms	360 KB	Output is correct
21	Correct	1 ms	360 KB	Output is correct
22	Correct	0 ms	360 KB	Output is correct
23	Correct	1 ms	360 KB	Output is correct
24	Correct	1 ms	360 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	0 ms	360 KB	Output is correct
27	Correct	1 ms	360 KB	Output is correct
28	Correct	1 ms	360 KB	Output is correct
29	Correct	1 ms	444 KB	Output is correct
30	Correct	1 ms	360 KB	Output is correct
31	Correct	1 ms	360 KB	Output is correct
32	Correct	1 ms	360 KB	Output is correct
33	Correct	1 ms	360 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	74 ms	600 KB	Output is correct
42	Correct	100 ms	1116 KB	Output is correct
43	Correct	70 ms	856 KB	Output is correct
44	Correct	80 ms	852 KB	Output is correct
45	Correct	89 ms	860 KB	Output is correct
46	Correct	136 ms	1272 KB	Output is correct
47	Correct	94 ms	1116 KB	Output is correct
48	Correct	106 ms	1264 KB	Output is correct
49	Correct	125 ms	1264 KB	Output is correct
50	Correct	91 ms	1116 KB	Output is correct
51	Correct	73 ms	1112 KB	Output is correct
52	Correct	88 ms	1116 KB	Output is correct
53	Correct	96 ms	1116 KB	Output is correct
54	Correct	82 ms	1272 KB	Output is correct
55	Correct	116 ms	1364 KB	Output is correct
56	Correct	97 ms	1112 KB	Output is correct
57	Correct	106 ms	1280 KB	Output is correct
58	Correct	115 ms	1276 KB	Output is correct
59	Correct	111 ms	1116 KB	Output is correct
60	Correct	111 ms	1116 KB	Output is correct
61	Correct	115 ms	1256 KB	Output is correct

Subtask #4
0 / 12.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	1 ms	360 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	396 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	360 KB	Output is correct
11	Correct	0 ms	360 KB	Output is correct
12	Correct	1 ms	360 KB	Output is correct
13	Correct	0 ms	360 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	1 ms	360 KB	Output is correct
18	Correct	0 ms	360 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	0 ms	360 KB	Output is correct
21	Correct	1 ms	360 KB	Output is correct
22	Correct	0 ms	360 KB	Output is correct
23	Correct	1 ms	360 KB	Output is correct
24	Correct	1 ms	360 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	0 ms	360 KB	Output is correct
27	Correct	1 ms	360 KB	Output is correct
28	Correct	1 ms	360 KB	Output is correct
29	Correct	1 ms	444 KB	Output is correct
30	Correct	1 ms	360 KB	Output is correct
31	Correct	1 ms	360 KB	Output is correct
32	Correct	1 ms	360 KB	Output is correct
33	Correct	1 ms	360 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	74 ms	600 KB	Output is correct
42	Correct	100 ms	1116 KB	Output is correct
43	Correct	70 ms	856 KB	Output is correct
44	Correct	80 ms	852 KB	Output is correct
45	Correct	89 ms	860 KB	Output is correct
46	Correct	136 ms	1272 KB	Output is correct
47	Correct	94 ms	1116 KB	Output is correct
48	Correct	106 ms	1264 KB	Output is correct
49	Correct	125 ms	1264 KB	Output is correct
50	Correct	91 ms	1116 KB	Output is correct
51	Correct	73 ms	1112 KB	Output is correct
52	Correct	88 ms	1116 KB	Output is correct
53	Correct	96 ms	1116 KB	Output is correct
54	Correct	82 ms	1272 KB	Output is correct
55	Correct	116 ms	1364 KB	Output is correct
56	Correct	97 ms	1112 KB	Output is correct
57	Correct	106 ms	1280 KB	Output is correct
58	Correct	115 ms	1276 KB	Output is correct
59	Correct	111 ms	1116 KB	Output is correct
60	Correct	111 ms	1116 KB	Output is correct
61	Correct	115 ms	1256 KB	Output is correct
62	Execution timed out	4050 ms	9556 KB	Time limit exceeded
63	Halted	0 ms	0 KB	-

Submission #903837

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 14.0 / 14.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 12.0

Subtask #5 0 / 5.0

Subtask #6 0 / 35.0

Subtask #1
14.0 / 14.0

Subtask #2
14.0 / 14.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 12.0

Subtask #5
0 / 5.0

Subtask #6
0 / 35.0