oj.uz

Submission #437551

# Submission time Handle Problem Language Result Execution time Memory
437551 2021-06-26T13:58:06 Z RohamIzadidoost Street Lamps (APIO19_street_lamps) C++14
60 / 100
 4844 ms 524292 KB 
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X   first
#define Y   second
#define mp  make_pair
#define pii pair<int , int>
#define vec vector
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ld long double
// BIG p : 1000000000000037 , 100000000003
ll poww(ll a, ll b, ll md) {
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
const int maxn = 3000*100+5 ;
const ll inf = 9223372036854775807 ;
const ll mod = 1e9 + 7 ;
const int lg = 20 ;
int n , q ; 
string c ; 
set<int> s ; 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gp_hash_table<ll, ll> fen[maxn];
ll res ;  
inline void add(int l , int r , ll x){
	for( ; l < maxn ; l += l & -l ) for(int i = r ; i < maxn ; i += i & -i ) fen[l][i] += x ; 
}
inline void get(int l , int r){
	res = 0 ; 
	for( ; l ; l &= l-1 ) for(int i = r ; i ; i &= i-1) if(fen[l].find(i) != fen[l].end()) res += fen[l][i] ; 
}
void doj(int l , int r , int l2 , int r2 , ll x){
	add(l , r , x) ; 
	add(l2 + 1 , r2 + 1 , x) ; 
	add(l , r2 + 1 , -x) ; 
	add(l2 + 1 , r , -x) ; 
}
int main()
{
	migmig ;
	/*for(int i = 1 ; i < maxn ; i ++ ){
		fen[i].max_load_factor(0.13); 
	}*/
	cin>>n>>q>>c ; 
	s.insert(0) ;
	s.insert(n + 1) ;  
	for(int i = 0 ; i < n ; i ++ ){
		if(c[i] == '0') s.insert(i + 1) ; 
	}
	int l , r ;
	ll v ;  
	for(ll i = 1 ; i <= q ; i ++ ){
		cin>>c ; 
		if(c == "query"){
			cin>>l>>r ; 
			get(l , r) ; 
			//cout<<*s.lower_bound(l) << endl ; 
			if(s.lower_bound(l) == s.lower_bound(r) ) res += i ; 
			cout<<res << "\n" ; 
			continue ; 	
		}
		cin>>v ; 
		auto p = s.lower_bound(v) ; 
		if(*p == v){
			l = *prev(p) + 1 ; 
			r = *next(p) ; 
			s.erase(v) ; 
			doj(l , v + 1 , v , r , -i ) ;
		//	cout<<l <<","<< r << endl ; 
			continue ;  
		}
		l = *prev(p) + 1 ; 
		r = *p ; 
	//	cout<<l<<" " << r << endl ; 
		s.insert(v) ; 
		doj(l , v + 1 , v , r , i) ; 
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 92016 KB Output is correct
2 Correct 89 ms 92024 KB Output is correct
3 Correct 91 ms 91860 KB Output is correct
4 Correct 89 ms 91972 KB Output is correct
5 Correct 99 ms 91992 KB Output is correct
6 Correct 94 ms 91844 KB Output is correct
7 Correct 86 ms 91844 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2421 ms 93260 KB Output is correct
2 Correct 2068 ms 93692 KB Output is correct
3 Correct 1932 ms 104560 KB Output is correct
4 Correct 3625 ms 383188 KB Output is correct
5 Correct 3551 ms 397964 KB Output is correct
6 Correct 3829 ms 401616 KB Output is correct
7 Correct 1326 ms 112800 KB Output is correct
8 Correct 757 ms 100168 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 93860 KB Output is correct
2 Correct 101 ms 93560 KB Output is correct
3 Correct 114 ms 93288 KB Output is correct
4 Correct 99 ms 91844 KB Output is correct
5 Runtime error 4315 ms 524292 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 92100 KB Output is correct
2 Correct 96 ms 93108 KB Output is correct
3 Correct 100 ms 93340 KB Output is correct
4 Correct 105 ms 93488 KB Output is correct
5 Correct 2125 ms 116604 KB Output is correct
6 Correct 3903 ms 344156 KB Output is correct
7 Correct 4388 ms 401436 KB Output is correct
8 Correct 4844 ms 438356 KB Output is correct
9 Correct 2843 ms 96504 KB Output is correct
10 Correct 4517 ms 95128 KB Output is correct
11 Correct 2905 ms 96400 KB Output is correct
12 Correct 4633 ms 95132 KB Output is correct
13 Correct 2937 ms 96364 KB Output is correct
14 Correct 4669 ms 95112 KB Output is correct
15 Correct 1378 ms 112868 KB Output is correct
16 Correct 743 ms 100196 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 92016 KB Output is correct
2 Correct 89 ms 92024 KB Output is correct
3 Correct 91 ms 91860 KB Output is correct
4 Correct 89 ms 91972 KB Output is correct
5 Correct 99 ms 91992 KB Output is correct
6 Correct 94 ms 91844 KB Output is correct
7 Correct 86 ms 91844 KB Output is correct
8 Correct 2421 ms 93260 KB Output is correct
9 Correct 2068 ms 93692 KB Output is correct
10 Correct 1932 ms 104560 KB Output is correct
11 Correct 3625 ms 383188 KB Output is correct
12 Correct 3551 ms 397964 KB Output is correct
13 Correct 3829 ms 401616 KB Output is correct
14 Correct 1326 ms 112800 KB Output is correct
15 Correct 757 ms 100168 KB Output is correct
16 Correct 105 ms 93860 KB Output is correct
17 Correct 101 ms 93560 KB Output is correct
18 Correct 114 ms 93288 KB Output is correct
19 Correct 99 ms 91844 KB Output is correct
20 Runtime error 4315 ms 524292 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -