oj.uz

Submission #502541

# Submission time Handle Problem Language Result Execution time Memory
502541 2022-01-06T08:22:22 Z beksultan04 Crossing (JOI21_crossing) C++14
26 / 100
 3455 ms 117564 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
#define ordered_set tree <int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 2e5+12,INF = 1e9+7;
int q[10][N],w[N],n,pref[N][10][4];
string s[5];
struct derevo{
	int lp,can;
	derevo (int x=0): can(x),lp(-1) {};
} der[N][10];

void fun(int a,int b,int c){
	for (int i=1;i<=n;++i)
		q[c][i] = ((3-(q[a][i]+q[b][i])+3)%3);
}

void build(int v,int l,int r,int j){
	if (l == r){
		der[v][j].can = (q[j][l] == w[l]);
		ret ;
	}
	int m = l+r>>1;
	build(v<<1,l,m,j);
	build(v<<1|1,m+1,r,j);
	der[v][j].can = (der[v<<1][j].can && der[v<<1|1][j].can);
}

void push(int v,int j,int l,int r){
	if (der[v][j].lp == -1)ret ;
	if (r == l){
		der[v][j].can = (der[v][j].lp == q[j][l]);
		der[v][j].lp = -1;
		ret ;
	}
	int m = l+r>>1;
	der[v<<1][j].can = ((pref[m][j][der[v][j].lp]-pref[l-1][j][der[v][j].lp]) == (m-l+1));
	der[v<<1|1][j].can = ((pref[r][j][der[v][j].lp]-pref[m][j][der[v][j].lp]) == (r-m));
	der[v<<1][j].lp = der[v][j].lp;
	der[v<<1|1][j].lp = der[v][j].lp;
	der[v][j].can = (der[v<<1][j].can && der[v<<1|1][j].can);
	der[v][j].lp = -1;
}

void update(int v,int l,int r,int ql,int qr,int x,int j){
	push(v,j,l,r);
	if (l > qr || r < ql){
		ret ;
	}
	if (ql <= l && r <= qr){
		der[v][j].lp = x;
		der[v][j].can = ((pref[r][j][x] - pref[l-1][j][x]) == (r-l+1));
		push(v,j,l,r);
		ret ;
	}
	int m = l+r>>1;
	update(v<<1,l,m,ql,qr,x,j);
	update(v<<1|1,m+1,r,ql,qr,x,j);
	der[v][j].can = (der[v<<1][j].can && der[v<<1|1][j].can);
}

void is(){
	for (int j=0;j<9;++j){
		
		if (der[1][j].can){
			cout <<"Yes\n";ret ;
		}
	}
	cout <<"No\n";
}

int main(){
	int i,m,j;
	cin>>n;
	cin>>s[0]>>s[1]>>s[2];
	
	for (i=0;i<n;++i){
		if (s[0][i] == 'J')
			q[0][i+1] = 1;
		if (s[1][i] == 'J')
			q[1][i+1] = 1;
		if (s[2][i] == 'J')
			q[2][i+1] = 1;
		if (s[0][i] == 'O')
			q[0][i+1] = 2;
		if (s[1][i] == 'O')
			q[1][i+1] = 2;
		if (s[2][i] == 'O')
			q[2][i+1] = 2;
	}
	fun(0,1,3);
	fun(0,2,4);
	fun(1,2,5);
	fun(3,2,6);
	fun(4,1,7);
	fun(5,0,8);
	cin>>m;
	cin>>s[3];
	
	for (j=0;j<9;++j){
		for (i=1;i<=n;++i){
			pref[i][j][0] = pref[i-1][j][0];
			pref[i][j][1] = pref[i-1][j][1];
			pref[i][j][2] = pref[i-1][j][2]; 
			pref[i][j][q[j][i]]++;
		}
	}
	
	for (i=0;i<n;++i){
		if (s[3][i] == 'J')
			w[i+1] = 1;
		if (s[3][i] == 'O')
			w[i+1] = 2;
	}
	
	for (j=0;j<9;++j)
		build(1,1,n,j);
	is();
	while (m--){
		int l,r,z=0;
		char ch;
		cin>>l>>r>>ch;
		if (ch == 'J')z = 1;
		if (ch == 'O')z = 2;
		for (j=0;j<9;++j){
			update(1,1,n,l,r,z,j);
		}
		is();
	}
	
}

Compilation message

Main.cpp: In constructor 'derevo::derevo(int)':
Main.cpp:24:9: warning: 'derevo::can' will be initialized after [-Wreorder]
   24 |  int lp,can;
      |         ^~~
Main.cpp:24:6: warning:   'int derevo::lp' [-Wreorder]
   24 |  int lp,can;
      |      ^~
Main.cpp:25:2: warning:   when initialized here [-Wreorder]
   25 |  derevo (int x=0): can(x),lp(-1) {};
      |  ^~~~~~
Main.cpp: In function 'void build(int, int, int, int)':
Main.cpp:38:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |  int m = l+r>>1;
      |          ~^~
Main.cpp: In function 'void push(int, int, int, int)':
Main.cpp:51:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |  int m = l+r>>1;
      |          ~^~
Main.cpp: In function 'void update(int, int, int, int, int, int, int)':
Main.cpp:71:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |  int m = l+r>>1;
      |          ~^~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 18068 KB Output is correct
2 Correct 670 ms 18116 KB Output is correct
3 Correct 761 ms 17916 KB Output is correct
4 Correct 557 ms 18068 KB Output is correct
5 Correct 565 ms 18008 KB Output is correct
6 Correct 566 ms 18036 KB Output is correct
7 Correct 565 ms 18052 KB Output is correct
8 Correct 591 ms 18140 KB Output is correct
9 Correct 590 ms 18160 KB Output is correct
10 Correct 592 ms 18020 KB Output is correct
11 Correct 594 ms 18480 KB Output is correct
12 Correct 603 ms 18068 KB Output is correct
13 Correct 596 ms 18196 KB Output is correct
14 Correct 600 ms 18116 KB Output is correct
15 Correct 613 ms 18112 KB Output is correct
16 Correct 601 ms 18148 KB Output is correct
17 Correct 595 ms 18080 KB Output is correct
18 Correct 788 ms 17952 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 18068 KB Output is correct
2 Correct 670 ms 18116 KB Output is correct
3 Correct 761 ms 17916 KB Output is correct
4 Correct 557 ms 18068 KB Output is correct
5 Correct 565 ms 18008 KB Output is correct
6 Correct 566 ms 18036 KB Output is correct
7 Correct 565 ms 18052 KB Output is correct
8 Correct 591 ms 18140 KB Output is correct
9 Correct 590 ms 18160 KB Output is correct
10 Correct 592 ms 18020 KB Output is correct
11 Correct 594 ms 18480 KB Output is correct
12 Correct 603 ms 18068 KB Output is correct
13 Correct 596 ms 18196 KB Output is correct
14 Correct 600 ms 18116 KB Output is correct
15 Correct 613 ms 18112 KB Output is correct
16 Correct 601 ms 18148 KB Output is correct
17 Correct 595 ms 18080 KB Output is correct
18 Correct 788 ms 17952 KB Output is correct
19 Correct 3111 ms 60624 KB Output is correct
20 Runtime error 3455 ms 117564 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 18068 KB Output is correct
2 Correct 670 ms 18116 KB Output is correct
3 Correct 761 ms 17916 KB Output is correct
4 Correct 557 ms 18068 KB Output is correct
5 Correct 565 ms 18008 KB Output is correct
6 Correct 566 ms 18036 KB Output is correct
7 Correct 565 ms 18052 KB Output is correct
8 Correct 591 ms 18140 KB Output is correct
9 Correct 590 ms 18160 KB Output is correct
10 Correct 592 ms 18020 KB Output is correct
11 Correct 594 ms 18480 KB Output is correct
12 Correct 603 ms 18068 KB Output is correct
13 Correct 596 ms 18196 KB Output is correct
14 Correct 600 ms 18116 KB Output is correct
15 Correct 613 ms 18112 KB Output is correct
16 Correct 601 ms 18148 KB Output is correct
17 Correct 595 ms 18080 KB Output is correct
18 Correct 788 ms 17952 KB Output is correct
19 Correct 680 ms 17956 KB Output is correct
20 Correct 835 ms 18052 KB Output is correct
21 Correct 709 ms 18048 KB Output is correct
22 Correct 588 ms 17956 KB Output is correct
23 Correct 636 ms 18152 KB Output is correct
24 Correct 619 ms 18016 KB Output is correct
25 Correct 665 ms 18064 KB Output is correct
26 Correct 630 ms 18032 KB Output is correct
27 Correct 652 ms 18076 KB Output is correct
28 Correct 545 ms 17836 KB Output is correct
29 Correct 612 ms 18128 KB Output is correct
30 Correct 585 ms 17956 KB Output is correct
31 Correct 643 ms 18124 KB Output is correct
32 Correct 632 ms 18088 KB Output is correct
33 Correct 630 ms 18132 KB Output is correct
34 Correct 565 ms 17936 KB Output is correct
35 Correct 663 ms 18144 KB Output is correct
36 Correct 642 ms 18128 KB Output is correct
37 Correct 635 ms 18144 KB Output is correct
38 Correct 628 ms 18076 KB Output is correct
39 Correct 664 ms 18024 KB Output is correct
40 Correct 638 ms 18160 KB Output is correct
41 Correct 660 ms 18052 KB Output is correct
42 Correct 675 ms 18108 KB Output is correct
43 Correct 656 ms 18280 KB Output is correct
44 Correct 635 ms 18188 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 18068 KB Output is correct
2 Correct 670 ms 18116 KB Output is correct
3 Correct 761 ms 17916 KB Output is correct
4 Correct 557 ms 18068 KB Output is correct
5 Correct 565 ms 18008 KB Output is correct
6 Correct 566 ms 18036 KB Output is correct
7 Correct 565 ms 18052 KB Output is correct
8 Correct 591 ms 18140 KB Output is correct
9 Correct 590 ms 18160 KB Output is correct
10 Correct 592 ms 18020 KB Output is correct
11 Correct 594 ms 18480 KB Output is correct
12 Correct 603 ms 18068 KB Output is correct
13 Correct 596 ms 18196 KB Output is correct
14 Correct 600 ms 18116 KB Output is correct
15 Correct 613 ms 18112 KB Output is correct
16 Correct 601 ms 18148 KB Output is correct
17 Correct 595 ms 18080 KB Output is correct
18 Correct 788 ms 17952 KB Output is correct
19 Correct 3111 ms 60624 KB Output is correct
20 Runtime error 3455 ms 117564 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -