oj.uz

Submission #894689

# Submission time Handle Problem Language Result Execution time Memory
894689 2023-12-28T17:35:59 Z AgentPengin 역사적 조사 (JOI14_historical) C++14
40 / 100
 4000 ms 13004 KB 
/**
 *    author:  AgentPengin ( Độc cô cầu bại )
 *    created: 23.12.2022 10:08:02
 *    too lazy to update time
**/
#include<bits/stdc++.h>

#define EL '\n'
#define fi first
#define se second
#define NAME "TASK"
#define ll long long
#define lcm(a,b) (a/gcd(a,b))*b
#define db(val) "["#val" = " << (val) << "] "
#define bend(v) (v).begin(),(v).end()
#define sz(v) (int)(v).size()
#define ex exit(0)
#define int ll

using namespace std;

const ll mod = 1e9 + 7;
const int inf = 0x1FFFFFFF;
const int MAXN = 1e5 + 5;
const int BLOCK_SIZE = 320;

struct Queries {
	int l,r,id;
} query[MAXN];

int n,a[MAXN],b[MAXN],c[MAXN],q,L = 1,R = 0,ans[MAXN];
vector<int> values;
int st[MAXN << 2];

void update(int pos,int val,int id = 1,int l = 0,int r = sz(values) -  1) {
	if (pos < l || pos > r) return;
	if (l == r) {
		st[id] += val;
		return;
	}
	int mid = l + r >> 1;
	if (pos <= mid) update(pos,val,id << 1,l,mid);
	else update(pos,val,id << 1 | 1,mid + 1,r);
	st[id] = max(st[id << 1],st[id << 1 | 1]);
}

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    if (ifstream(NAME".inp")) {
        freopen(NAME".inp","r",stdin);
        freopen(NAME".out","w",stdout);
    }
    cin >> n >> q;
    for (int i = 1;i <= n;i++) {
    	cin >> a[i];
		values.push_back(a[i]);    	
    }
    sort(bend(values));
	for (int i = 1;i <= n;i++) {
		b[i] = lower_bound(bend(values),a[i]) - values.begin();
		c[b[i]] = a[i];
	}
	for (int i = 1;i <=q ;i++) {
		cin >> query[i].l >> query[i].r;
		query[i].id = i;
	}
	sort(query + 1,query + q + 1,[&](const Queries& A,const Queries& B){
		if (A.l / BLOCK_SIZE != B.l / BLOCK_SIZE) return A.l / BLOCK_SIZE < B.l / BLOCK_SIZE;
		else return A.r < B.r;
	});
	for (int i = 1;i <= q;i++) {
		int l = query[i].l;
		int r = query[i].r;
		int id = query[i].id;
		while(L < l) {
			update(b[L],-values[b[L]]);
			++L;
		}
		while(L > l) {
			--L;
			update(b[L],+values[b[L]]);
		}
		while(R < r) {
			++R;
			update(b[R],+values[b[R]]);
		}
		while(R > r) {
			update(b[R],-values[b[R]]);
			--R;
		}
		
		
		ans[id] = st[1];
	}
	for (int i = 1;i <= q;i++) cout << ans[i] << EL;
	
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
// agent pengin wants to take apio (with anya-san)

Compilation message

historic.cpp: In function 'void update(long long int, long long int, long long int, long long int, long long int)':
historic.cpp:41:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |  int mid = l + r >> 1;
      |            ~~^~~
historic.cpp: In function 'int main()':
historic.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(NAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
historic.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen(NAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4568 KB Output is correct
13 Correct 1 ms 4568 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4568 KB Output is correct
13 Correct 1 ms 4568 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 4 ms 4580 KB Output is correct
19 Correct 9 ms 4444 KB Output is correct
20 Correct 23 ms 6796 KB Output is correct
21 Correct 37 ms 7000 KB Output is correct
22 Correct 37 ms 6920 KB Output is correct
23 Correct 34 ms 6744 KB Output is correct
24 Correct 34 ms 6892 KB Output is correct
25 Correct 38 ms 6920 KB Output is correct
26 Correct 40 ms 6744 KB Output is correct
27 Correct 39 ms 6744 KB Output is correct
28 Correct 39 ms 6932 KB Output is correct
29 Correct 40 ms 6964 KB Output is correct
30 Correct 41 ms 6988 KB Output is correct
31 Correct 35 ms 6948 KB Output is correct
32 Correct 34 ms 6748 KB Output is correct
33 Correct 39 ms 6952 KB Output is correct
34 Correct 40 ms 6960 KB Output is correct
35 Correct 38 ms 6948 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 6 ms 7152 KB Output is correct
9 Correct 12 ms 7392 KB Output is correct
10 Correct 13 ms 7388 KB Output is correct
11 Correct 50 ms 11728 KB Output is correct
12 Correct 53 ms 8468 KB Output is correct
13 Correct 55 ms 10960 KB Output is correct
14 Correct 68 ms 11724 KB Output is correct
15 Correct 95 ms 13004 KB Output is correct
16 Correct 53 ms 11724 KB Output is correct
17 Correct 39 ms 10444 KB Output is correct
18 Correct 55 ms 12176 KB Output is correct
19 Correct 47 ms 12324 KB Output is correct
20 Correct 29 ms 10968 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4568 KB Output is correct
13 Correct 1 ms 4568 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 4 ms 4580 KB Output is correct
19 Correct 9 ms 4444 KB Output is correct
20 Correct 23 ms 6796 KB Output is correct
21 Correct 37 ms 7000 KB Output is correct
22 Correct 37 ms 6920 KB Output is correct
23 Correct 34 ms 6744 KB Output is correct
24 Correct 34 ms 6892 KB Output is correct
25 Correct 38 ms 6920 KB Output is correct
26 Correct 40 ms 6744 KB Output is correct
27 Correct 39 ms 6744 KB Output is correct
28 Correct 39 ms 6932 KB Output is correct
29 Correct 40 ms 6964 KB Output is correct
30 Correct 41 ms 6988 KB Output is correct
31 Correct 35 ms 6948 KB Output is correct
32 Correct 34 ms 6748 KB Output is correct
33 Correct 39 ms 6952 KB Output is correct
34 Correct 40 ms 6960 KB Output is correct
35 Correct 38 ms 6948 KB Output is correct
36 Correct 1 ms 4440 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 6 ms 7152 KB Output is correct
44 Correct 12 ms 7392 KB Output is correct
45 Correct 13 ms 7388 KB Output is correct
46 Correct 50 ms 11728 KB Output is correct
47 Correct 53 ms 8468 KB Output is correct
48 Correct 55 ms 10960 KB Output is correct
49 Correct 68 ms 11724 KB Output is correct
50 Correct 95 ms 13004 KB Output is correct
51 Correct 53 ms 11724 KB Output is correct
52 Correct 39 ms 10444 KB Output is correct
53 Correct 55 ms 12176 KB Output is correct
54 Correct 47 ms 12324 KB Output is correct
55 Correct 29 ms 10968 KB Output is correct
56 Correct 90 ms 9052 KB Output is correct
57 Correct 298 ms 9436 KB Output is correct
58 Correct 596 ms 10196 KB Output is correct
59 Correct 1008 ms 10308 KB Output is correct
60 Correct 1429 ms 10708 KB Output is correct
61 Correct 1981 ms 11160 KB Output is correct
62 Correct 2464 ms 11724 KB Output is correct
63 Correct 2361 ms 12288 KB Output is correct
64 Correct 2561 ms 12540 KB Output is correct
65 Correct 3234 ms 12600 KB Output is correct
66 Correct 3021 ms 12788 KB Output is correct
67 Execution timed out 4013 ms 11728 KB Time limit exceeded
68 Halted 0 ms 0 KB -