oj.uz

Submission #746661

# Submission time Handle Problem Language Result Execution time Memory
746661 2023-05-23T00:32:14 Z arthur_nascimento Fish 2 (JOI22_fish2) C++14
13 / 100
 4000 ms 16260 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <ctime>
 
using namespace std;
 
 
 
#define maxn 200200
 
#define pb push_back
 
#define debug 
 
#define pii pair<int,int>
 
#define ll long long
 
#define mod 998244353
 
#define inf (1<<30)
 
int v_ord[maxn];
int v_rev[maxn];
 
struct query {
	int l, r, id;
	query(int l=0,int r=0,int id=0): l(l), r(r), id(id) {}
};
 
int ans[maxn];
 
int stck[maxn];
int ans_acc[maxn];
int sz;
 
vector<query> Q[maxn];
vector<int> event[maxn];
 
ll acc[maxn];
 
ll sum(int a,int b){
	ll r = acc[b];
	if(a) r -= acc[a-1];
	return r;
}
 
int greater_L[maxn];
int greater_R[maxn];
 
int value[maxn];
 
void erase(set<int> &S,int a){
	if(S.find(a) != S.end()) S.erase(a);
}
 
void solve(int *fish, int n, int eps , vector<query> vq){
 
	debug("hey\n");
 
	stck[0] = 0;
	ans_acc[0] = 0;
	sz = 1;
 
	for(int i=0;i<n;i++){
 
		acc[i] = fish[i];
		if(i) acc[i] += acc[i-1];
 
		Q[i].clear();
		event[i].clear();
 
		value[i] = 1;
 
	}
 
	for(auto q : vq)
		Q[q.r].pb(q);
 
	set<int> S, happy, unhappy;
	unhappy.insert(n+1);
	happy.insert(-1);
 
	for(int i=1;i<n-1;i++){
 
		while(fish[i] + eps > fish[stck[sz-1]]){
 
			int rem = stck[sz-1];
			greater_R[rem] = i;
 
			int jmp = i;
			if(fish[i] + eps > fish[stck[sz-2]])
				jmp = stck[sz-2];
 
			ll eats = sum(greater_L[rem] + 1, greater_R[rem] - 1), survives = 0;
			if(eats >= fish[jmp])
				value[jmp] += value[rem], survives = 1;
 
			erase(S, stck[sz-1]);
			erase(happy, stck[sz-1]);
			erase(unhappy, stck[sz-1]);
			debug("pop %d, eats %d, surv %d jmp %d\n",stck[sz-1],eats,survives,jmp);
			sz--;
 
		}
 
		greater_L[i] = stck[sz-1];
		ans_acc[i] = value[i] + ans_acc[stck[sz-1]];
 
		stck[sz++] = i;
 
		int lo = i, hi = n;
		while(lo < hi){
			int mid = (lo+hi)/2;
			if(sum(greater_L[i]+1,mid) >= fish[greater_L[i]])
				hi = mid;
			else
				lo = mid+1;
		}
 
		event[lo].pb(i);
		debug("i %d gr_L %d walk_R %d\n\n",i,greater_L[i],lo); 
 
		S.insert(i);
		unhappy.insert(i);
 
		for(int a : event[i]){
			if(S.find(a) != S.end()){
				unhappy.erase(a);
				happy.insert(a);
			}
		}
 
		for(auto q : Q[i]){
			int L = q.l;
			int top = *S.lower_bound(L);
			int first_bad = *unhappy.upper_bound(top);
			int last_good = *--happy.lower_bound(first_bad);
			debug("query %d: top %d, bad = %d, good = %d\n",q.id,top,first_bad,last_good);
			if(last_good > top)
				ans[q.id] += ans_acc[last_good] - ans_acc[top];
		}
	
	}
 
}
 
int 
main(){
 
	int n,q;
	scanf("%d",&n);
 
	for(int i=1;i<=n;i++){
		scanf("%d",v_ord+i);
		v_rev[n-i+1] = v_ord[i];
	}
 
	v_ord[0] = v_ord[n+1] = v_rev[0] = v_rev[n+1] = inf;
 
	scanf("%d",&q);
 
	vector<query> vq;
 
	for(int i=0;i<q;i++){
 
		int l,r;
        int ty;
		scanf("%d%d%d",&ty,&l,&r);

        if(ty == 1){
            v_ord[l] = r;
            v_rev[n-l+1] = r;
        }
        else {
            vq.clear();
            ans[0] = 0;
            vq.pb(query(l,r,0));
            solve(v_ord, n+2, 0, vq);
 
            for(auto &e : vq){
                e.l = n - e.l + 1;
                e.r = n - e.r + 1;
                swap(e.l,e.r);
            }
        
            solve(v_rev, n+2, 1, vq);
        
            printf("%d\n",1+ans[0]);
 
        }
		//vq.pb(query(l,r,i));
 
	}

 
}

Compilation message

fish2.cpp: In function 'void solve(int*, int, int, std::vector<query>)':
fish2.cpp:63:8: warning: statement has no effect [-Wunused-value]
   63 |  debug("hey\n");
      |       ~^~~~~~~~
fish2.cpp:106:10: warning: left operand of comma operator has no effect [-Wunused-value]
  106 |    debug("pop %d, eats %d, surv %d jmp %d\n",stck[sz-1],eats,survives,jmp);
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish2.cpp:106:55: warning: right operand of comma operator has no effect [-Wunused-value]
  106 |    debug("pop %d, eats %d, surv %d jmp %d\n",stck[sz-1],eats,survives,jmp);
      |                                              ~~~~~~~~~^
fish2.cpp:106:62: warning: right operand of comma operator has no effect [-Wunused-value]
  106 |    debug("pop %d, eats %d, surv %d jmp %d\n",stck[sz-1],eats,survives,jmp);
      |                                                              ^~~~~~~~
fish2.cpp:106:71: warning: right operand of comma operator has no effect [-Wunused-value]
  106 |    debug("pop %d, eats %d, surv %d jmp %d\n",stck[sz-1],eats,survives,jmp);
      |                                                                       ^~~
fish2.cpp:126:9: warning: left operand of comma operator has no effect [-Wunused-value]
  126 |   debug("i %d gr_L %d walk_R %d\n\n",i,greater_L[i],lo);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish2.cpp:126:51: warning: right operand of comma operator has no effect [-Wunused-value]
  126 |   debug("i %d gr_L %d walk_R %d\n\n",i,greater_L[i],lo);
      |                                                   ^
fish2.cpp:126:51: warning: right operand of comma operator has no effect [-Wunused-value]
  126 |   debug("i %d gr_L %d walk_R %d\n\n",i,greater_L[i],lo);
      |                                        ~~~~~~~~~~~^
fish2.cpp:143:10: warning: left operand of comma operator has no effect [-Wunused-value]
  143 |    debug("query %d: top %d, bad = %d, good = %d\n",q.id,top,first_bad,last_good);
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish2.cpp:143:54: warning: right operand of comma operator has no effect [-Wunused-value]
  143 |    debug("query %d: top %d, bad = %d, good = %d\n",q.id,top,first_bad,last_good);
      |                                                    ~~^~
fish2.cpp:143:61: warning: right operand of comma operator has no effect [-Wunused-value]
  143 |    debug("query %d: top %d, bad = %d, good = %d\n",q.id,top,first_bad,last_good);
      |                                                             ^~~~~~~~~
fish2.cpp:143:71: warning: right operand of comma operator has no effect [-Wunused-value]
  143 |    debug("query %d: top %d, bad = %d, good = %d\n",q.id,top,first_bad,last_good);
      |                                                                       ^~~~~~~~~
fish2.cpp: In function 'int main()':
fish2.cpp:156:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  156 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
fish2.cpp:159:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  159 |   scanf("%d",v_ord+i);
      |   ~~~~~^~~~~~~~~~~~~~
fish2.cpp:165:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |  scanf("%d",&q);
      |  ~~~~~^~~~~~~~~
fish2.cpp:173:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |   scanf("%d%d%d",&ty,&l,&r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 7 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9712 KB Output is correct
5 Correct 32 ms 9784 KB Output is correct
6 Correct 105 ms 9684 KB Output is correct
7 Correct 29 ms 9684 KB Output is correct
8 Correct 73 ms 9904 KB Output is correct
9 Correct 103 ms 9684 KB Output is correct
10 Correct 46 ms 9788 KB Output is correct
11 Correct 125 ms 9684 KB Output is correct
12 Correct 29 ms 9684 KB Output is correct
13 Correct 109 ms 9792 KB Output is correct
14 Correct 32 ms 9684 KB Output is correct
15 Correct 63 ms 9796 KB Output is correct
16 Correct 121 ms 9788 KB Output is correct
17 Correct 45 ms 9684 KB Output is correct
18 Correct 125 ms 9684 KB Output is correct
19 Correct 61 ms 9844 KB Output is correct
20 Correct 118 ms 9792 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 72 ms 14412 KB Output is correct
3 Correct 70 ms 14728 KB Output is correct
4 Correct 77 ms 14512 KB Output is correct
5 Correct 76 ms 14724 KB Output is correct
6 Correct 78 ms 16260 KB Output is correct
7 Correct 83 ms 15540 KB Output is correct
8 Correct 83 ms 16244 KB Output is correct
9 Correct 88 ms 15528 KB Output is correct
10 Correct 94 ms 15304 KB Output is correct
11 Correct 75 ms 15460 KB Output is correct
12 Correct 88 ms 15648 KB Output is correct
13 Correct 101 ms 15732 KB Output is correct
14 Correct 87 ms 15536 KB Output is correct
15 Correct 92 ms 15384 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 7 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9712 KB Output is correct
5 Correct 32 ms 9784 KB Output is correct
6 Correct 105 ms 9684 KB Output is correct
7 Correct 29 ms 9684 KB Output is correct
8 Correct 73 ms 9904 KB Output is correct
9 Correct 103 ms 9684 KB Output is correct
10 Correct 46 ms 9788 KB Output is correct
11 Correct 125 ms 9684 KB Output is correct
12 Correct 29 ms 9684 KB Output is correct
13 Correct 109 ms 9792 KB Output is correct
14 Correct 32 ms 9684 KB Output is correct
15 Correct 63 ms 9796 KB Output is correct
16 Correct 121 ms 9788 KB Output is correct
17 Correct 45 ms 9684 KB Output is correct
18 Correct 125 ms 9684 KB Output is correct
19 Correct 61 ms 9844 KB Output is correct
20 Correct 118 ms 9792 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 72 ms 14412 KB Output is correct
23 Correct 70 ms 14728 KB Output is correct
24 Correct 77 ms 14512 KB Output is correct
25 Correct 76 ms 14724 KB Output is correct
26 Correct 78 ms 16260 KB Output is correct
27 Correct 83 ms 15540 KB Output is correct
28 Correct 83 ms 16244 KB Output is correct
29 Correct 88 ms 15528 KB Output is correct
30 Correct 94 ms 15304 KB Output is correct
31 Correct 75 ms 15460 KB Output is correct
32 Correct 88 ms 15648 KB Output is correct
33 Correct 101 ms 15732 KB Output is correct
34 Correct 87 ms 15536 KB Output is correct
35 Correct 92 ms 15384 KB Output is correct
36 Execution timed out 4043 ms 14736 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 72 ms 14412 KB Output is correct
3 Correct 70 ms 14728 KB Output is correct
4 Correct 77 ms 14512 KB Output is correct
5 Correct 76 ms 14724 KB Output is correct
6 Correct 78 ms 16260 KB Output is correct
7 Correct 83 ms 15540 KB Output is correct
8 Correct 83 ms 16244 KB Output is correct
9 Correct 88 ms 15528 KB Output is correct
10 Correct 94 ms 15304 KB Output is correct
11 Correct 75 ms 15460 KB Output is correct
12 Correct 88 ms 15648 KB Output is correct
13 Correct 101 ms 15732 KB Output is correct
14 Correct 87 ms 15536 KB Output is correct
15 Correct 92 ms 15384 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Execution timed out 4034 ms 14980 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 72 ms 14412 KB Output is correct
3 Correct 70 ms 14728 KB Output is correct
4 Correct 77 ms 14512 KB Output is correct
5 Correct 76 ms 14724 KB Output is correct
6 Correct 78 ms 16260 KB Output is correct
7 Correct 83 ms 15540 KB Output is correct
8 Correct 83 ms 16244 KB Output is correct
9 Correct 88 ms 15528 KB Output is correct
10 Correct 94 ms 15304 KB Output is correct
11 Correct 75 ms 15460 KB Output is correct
12 Correct 88 ms 15648 KB Output is correct
13 Correct 101 ms 15732 KB Output is correct
14 Correct 87 ms 15536 KB Output is correct
15 Correct 92 ms 15384 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Execution timed out 4038 ms 14988 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 7 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 7 ms 9712 KB Output is correct
5 Correct 32 ms 9784 KB Output is correct
6 Correct 105 ms 9684 KB Output is correct
7 Correct 29 ms 9684 KB Output is correct
8 Correct 73 ms 9904 KB Output is correct
9 Correct 103 ms 9684 KB Output is correct
10 Correct 46 ms 9788 KB Output is correct
11 Correct 125 ms 9684 KB Output is correct
12 Correct 29 ms 9684 KB Output is correct
13 Correct 109 ms 9792 KB Output is correct
14 Correct 32 ms 9684 KB Output is correct
15 Correct 63 ms 9796 KB Output is correct
16 Correct 121 ms 9788 KB Output is correct
17 Correct 45 ms 9684 KB Output is correct
18 Correct 125 ms 9684 KB Output is correct
19 Correct 61 ms 9844 KB Output is correct
20 Correct 118 ms 9792 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 72 ms 14412 KB Output is correct
23 Correct 70 ms 14728 KB Output is correct
24 Correct 77 ms 14512 KB Output is correct
25 Correct 76 ms 14724 KB Output is correct
26 Correct 78 ms 16260 KB Output is correct
27 Correct 83 ms 15540 KB Output is correct
28 Correct 83 ms 16244 KB Output is correct
29 Correct 88 ms 15528 KB Output is correct
30 Correct 94 ms 15304 KB Output is correct
31 Correct 75 ms 15460 KB Output is correct
32 Correct 88 ms 15648 KB Output is correct
33 Correct 101 ms 15732 KB Output is correct
34 Correct 87 ms 15536 KB Output is correct
35 Correct 92 ms 15384 KB Output is correct
36 Execution timed out 4043 ms 14736 KB Time limit exceeded
37 Halted 0 ms 0 KB -