제출 #502079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502079		beksultan04	Crossing (JOI21_crossing)	C++14	26 / 100	7066 ms	10320 KiB

Main

#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,ans[10];
string s[5];

void fun(int a,int b,int c){
	for (int i=0;i<n;++i)
		q[c][i] = ((3-(q[a][i]+q[b][i])+3)%3);
}
void is(){
	for (int i=0;i<9;++i){
		if (ans[i] == n){
			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;
		if (s[1][i] == 'J')
			q[1][i] = 1;
		if (s[2][i] == 'J')
			q[2][i] = 1;
		if (s[0][i] == 'O')
			q[0][i] = 2;
		if (s[1][i] == 'O')
			q[1][i] = 2;
		if (s[2][i] == 'O')
			q[2][i] = 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 (i=0;i<n;++i){
		if (s[3][i] == 'J')
			w[i] = 1;
		if (s[3][i] == 'O')
			w[i] = 2;
		for (j=0;j<9;++j){
			if (q[j][i] == w[i]){
				ans[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 (i=l-1;i<r;++i){
			
			for (j=0;j<9;++j){
				if (q[j][i] == w[i]){
					ans[j]--;
				}
			}
			w[i] = z;
			for (j=0;j<9;++j){
				if (q[j][i] == w[i]){
					ans[j]++;
				}
			}
		}
		is();
	}
	
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 23
• Subtask 3: 23 / 23
• Subtask 4: 0 / 51