# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
981979 |
2024-05-13T17:30:26 Z |
nnin |
Sequence (APIO23_sequence) |
C++17 |
|
715 ms |
74832 KB |
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
vector<int> ct[500005];
int N;
struct segTree {
pii seg[4*500005];
int lazy[4*500005];
void laze(int i, int l, int r) {
seg[i].f += lazy[i];
seg[i].s += lazy[i];
if(l!=r) {
lazy[i*2+1] += lazy[i];
lazy[i*2+2] += lazy[i];
}
lazy[i] = 0;
}
void build(int i, int l, int r) {
lazy[i] = 0;
if(l==r) {
seg[i].f = seg[i].s = l;
return;
}
int m = (l+r)/2;
build(i*2+1, l, m);
build(i*2+2, m+1, r);
seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
}
void build() {
build(0, 0, N);
}
void update(int i, int l, int r, int wl, int wr, int val) {
if(wl<=l && wr>=r) lazy[i] += val;
laze(i, l, r);
if(wl>r || wr<l || (wl<=l && wr>=r)) return;
int m = (l+r)/2;
update(i*2+1, l, m, wl, wr, val);
update(i*2+2, m+1, r, wl, wr, val);
seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
}
void update(int wl, int wr, int val) {
update(0, 0, N, wl, wr, val);
}
pii query(int i, int l, int r, int wl, int wr) {
laze(i, l, r);
if(wl>r || wr<l || wl>wr) return {(int)1e9, (int)-1e9};
if(wl<=l && wr>=r) return seg[i];
int m = (l+r)/2;
pii q1 = query(i*2+1, l, m, wl, wr);
pii q2 = query(i*2+2, m+1, r, wl, wr);
return {min(q1.f, q2.f), max(q1.s, q2.s)};
}
pii query(int wl, int wr) {
return query(0, 0, N, wl, wr);
}
} les, mor;
int sequence(int n, std::vector<int> A) {
N = n;
for(int i=0;i<N;i++) {
ct[A[i]].push_back(i+1);
}
les.build();
mor.build();
int ans = 1;
for(int i=1;i<=N;i++) {
for(int j:ct[i]) {
les.update(j, N, -2);
}
for(int j:ct[i-1]) {
mor.update(j, N, -2);
}
for(int j=0;j+ans<ct[i].size();j++) {
while(j+ans<ct[i].size()) {
int st = ct[i][j];
int en = ct[i][j+ans];
int qles = les.query(en, N).f - les.query(0, st-1).s;
int qmor = mor.query(en, N).s - les.query(0, st-1).f;
if(qles<=0 && qmor>=0) ans++;
else break;
}
}
}
return ans;
}
Compilation message
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
84 | for(int j=0;j+ans<ct[i].size();j++) {
| ~~~~~^~~~~~~~~~~~~
sequence.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | while(j+ans<ct[i].size()) {
| ~~~~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
46684 KB |
Output is correct |
2 |
Correct |
8 ms |
46684 KB |
Output is correct |
3 |
Correct |
8 ms |
46684 KB |
Output is correct |
4 |
Correct |
8 ms |
46684 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
7 ms |
46836 KB |
Output is correct |
7 |
Correct |
7 ms |
46680 KB |
Output is correct |
8 |
Correct |
8 ms |
46684 KB |
Output is correct |
9 |
Correct |
8 ms |
46620 KB |
Output is correct |
10 |
Correct |
8 ms |
46936 KB |
Output is correct |
11 |
Correct |
9 ms |
46624 KB |
Output is correct |
12 |
Correct |
8 ms |
46684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
46684 KB |
Output is correct |
2 |
Correct |
8 ms |
46684 KB |
Output is correct |
3 |
Correct |
8 ms |
46684 KB |
Output is correct |
4 |
Correct |
8 ms |
46684 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
7 ms |
46836 KB |
Output is correct |
7 |
Correct |
7 ms |
46680 KB |
Output is correct |
8 |
Correct |
8 ms |
46684 KB |
Output is correct |
9 |
Correct |
8 ms |
46620 KB |
Output is correct |
10 |
Correct |
8 ms |
46936 KB |
Output is correct |
11 |
Correct |
9 ms |
46624 KB |
Output is correct |
12 |
Correct |
8 ms |
46684 KB |
Output is correct |
13 |
Correct |
9 ms |
46684 KB |
Output is correct |
14 |
Correct |
9 ms |
46684 KB |
Output is correct |
15 |
Correct |
9 ms |
46872 KB |
Output is correct |
16 |
Correct |
9 ms |
46684 KB |
Output is correct |
17 |
Correct |
9 ms |
46680 KB |
Output is correct |
18 |
Correct |
9 ms |
46732 KB |
Output is correct |
19 |
Correct |
9 ms |
46684 KB |
Output is correct |
20 |
Correct |
9 ms |
46684 KB |
Output is correct |
21 |
Incorrect |
9 ms |
46680 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
46684 KB |
Output is correct |
2 |
Correct |
316 ms |
68692 KB |
Output is correct |
3 |
Correct |
312 ms |
68688 KB |
Output is correct |
4 |
Correct |
418 ms |
62028 KB |
Output is correct |
5 |
Correct |
310 ms |
71056 KB |
Output is correct |
6 |
Correct |
311 ms |
71236 KB |
Output is correct |
7 |
Correct |
290 ms |
62800 KB |
Output is correct |
8 |
Correct |
389 ms |
62948 KB |
Output is correct |
9 |
Correct |
447 ms |
61804 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
46684 KB |
Output is correct |
2 |
Correct |
518 ms |
61192 KB |
Output is correct |
3 |
Correct |
614 ms |
61052 KB |
Output is correct |
4 |
Correct |
604 ms |
62028 KB |
Output is correct |
5 |
Correct |
715 ms |
62156 KB |
Output is correct |
6 |
Incorrect |
600 ms |
62112 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
483 ms |
74832 KB |
Output is correct |
2 |
Correct |
436 ms |
74380 KB |
Output is correct |
3 |
Correct |
468 ms |
73888 KB |
Output is correct |
4 |
Correct |
483 ms |
74032 KB |
Output is correct |
5 |
Correct |
468 ms |
70480 KB |
Output is correct |
6 |
Correct |
475 ms |
70692 KB |
Output is correct |
7 |
Correct |
437 ms |
69488 KB |
Output is correct |
8 |
Correct |
423 ms |
69176 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
46684 KB |
Output is correct |
2 |
Correct |
8 ms |
46684 KB |
Output is correct |
3 |
Correct |
8 ms |
46684 KB |
Output is correct |
4 |
Correct |
8 ms |
46684 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
7 ms |
46836 KB |
Output is correct |
7 |
Correct |
7 ms |
46680 KB |
Output is correct |
8 |
Correct |
8 ms |
46684 KB |
Output is correct |
9 |
Correct |
8 ms |
46620 KB |
Output is correct |
10 |
Correct |
8 ms |
46936 KB |
Output is correct |
11 |
Correct |
9 ms |
46624 KB |
Output is correct |
12 |
Correct |
8 ms |
46684 KB |
Output is correct |
13 |
Correct |
9 ms |
46684 KB |
Output is correct |
14 |
Correct |
9 ms |
46684 KB |
Output is correct |
15 |
Correct |
9 ms |
46872 KB |
Output is correct |
16 |
Correct |
9 ms |
46684 KB |
Output is correct |
17 |
Correct |
9 ms |
46680 KB |
Output is correct |
18 |
Correct |
9 ms |
46732 KB |
Output is correct |
19 |
Correct |
9 ms |
46684 KB |
Output is correct |
20 |
Correct |
9 ms |
46684 KB |
Output is correct |
21 |
Incorrect |
9 ms |
46680 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
46684 KB |
Output is correct |
2 |
Correct |
8 ms |
46684 KB |
Output is correct |
3 |
Correct |
8 ms |
46684 KB |
Output is correct |
4 |
Correct |
8 ms |
46684 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
7 ms |
46836 KB |
Output is correct |
7 |
Correct |
7 ms |
46680 KB |
Output is correct |
8 |
Correct |
8 ms |
46684 KB |
Output is correct |
9 |
Correct |
8 ms |
46620 KB |
Output is correct |
10 |
Correct |
8 ms |
46936 KB |
Output is correct |
11 |
Correct |
9 ms |
46624 KB |
Output is correct |
12 |
Correct |
8 ms |
46684 KB |
Output is correct |
13 |
Correct |
9 ms |
46684 KB |
Output is correct |
14 |
Correct |
9 ms |
46684 KB |
Output is correct |
15 |
Correct |
9 ms |
46872 KB |
Output is correct |
16 |
Correct |
9 ms |
46684 KB |
Output is correct |
17 |
Correct |
9 ms |
46680 KB |
Output is correct |
18 |
Correct |
9 ms |
46732 KB |
Output is correct |
19 |
Correct |
9 ms |
46684 KB |
Output is correct |
20 |
Correct |
9 ms |
46684 KB |
Output is correct |
21 |
Incorrect |
9 ms |
46680 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |