oj.uz

답안 #479395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479395 2021-10-11T15:15:09 Z Arvin Crossing (JOI21_crossing) C++11
26 / 100
 7000 ms 10200 KB 
#include <bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353

const int maxN = 2e5 + 5;
const ll base = 5;

int n;
ll prefix[maxN];

ll convert(char c){
	if(c == 'J') return 0;
	else if(c == 'O') return 1;
	else if(c == 'I') return 2;
	return 3;
}

struct SegTree { // index start from 0 (v)
	ll tree[8*maxN], lazy[8*maxN];
	
	void build(int v, int l, int r, string s){
		if(l > r) return;
		if(l == r){
			tree[v] = (prefix[l] - (l > 0 ? prefix[l-1] : 0) + mod) % mod * convert(s[l]) % mod;
			lazy[v] = -1;
			return;
		}
		
		int m = (l+r) >> 1;
		build(v*2+1, l, m, s);
		build(v*2+2, m+1, r, s);
		
		tree[v] = (tree[v*2+1] + tree[v*2+2]) % mod;
		lazy[v] = -1;
	}
	
	void push(int v, int l, int m, int r){
		if(lazy[v] == -1) return;
		
		tree[v*2+1] = (prefix[m] - (l > 0 ? prefix[l-1] : 0) + mod) % mod * lazy[v] % mod;
		lazy[v*2+1] = lazy[v];
		
		tree[v*2+2] = (prefix[r] - prefix[m] + mod) % mod * lazy[v] % mod;
		lazy[v*2+2] = lazy[v];
		
		lazy[v] = -1;
	}
	
	void update(int v, int curL, int curR, int l, int r, ll val){
		if(l > r) return;
		if(curL == l && r == curR){
			tree[v] = (prefix[curR] - (curL > 0 ? prefix[curL-1] : 0) + mod) % mod * val % mod;
			lazy[v] = val;
		} else {
			int curM = (curL+curR) >> 1;
			
			push(v, curL, curM, curR);
			
			update(v*2+1, curL, curM, l, min(r, curM), val);
			update(v*2+2, curM+1, curR, max(l, curM+1), r, val);
			
			tree[v] = (tree[v*2+1] + tree[v*2+2]) % mod;
		}
	}
	
	ll query(int v, int curL, int curR, int l, int r){
		if(l > r || curL > curR) return 0;
		if(l <= curL && curR <= r){
			return tree[v];
		}
		
		int curM = (curL+curR) >> 1;

		push(v, curL, curM, curR);
		
		return (query(v*2+1, curL, curM, l, min(r, curM)) + query(v*2+2, curM+1, curR, max(l, curM+1), r)) % mod;
	}
};

SegTree tree;

int main(){
	ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	
	cin >> n;
	
	ll cur = 1;
	prefix[0] = 1;
	for(int x=1;x<n;x++){
		cur *= base;
		cur %= mod;
		prefix[x] = (prefix[x-1] + cur) % mod;
	}
	
	set<string> st;
	vector<string> v;
	
	for(int x=0;x<3;x++){
		string s;
		cin >> s;
		
		if(!st.count(s)){
			st.insert(s);
			v.push_back(s);
		}
	}
	
	for(int x=0;x<v.size();x++){
		for(int y=0;y<x;y++){
			string tmp;
			for(int z=0;z<v[x].length();z++){
				if(v[x][z] == v[y][z]){
					tmp.push_back(v[x][z]);
				} else {
					int bit = (1 << convert(v[x][z]));
					bit |= (1 << convert(v[y][z]));
					
					for(int i=0;i<3;i++){
						if(!(bit&(1<<i))){
							if(i == 0) tmp.push_back('J');
							else if(i == 1) tmp.push_back('O');
							else tmp.push_back('I');
							break;
						}
					}
				}
			}
			
			if(!st.count(tmp)){
				st.insert(tmp);
				v.push_back(tmp);
			}
		}
	}
	
	set<ll> st2;
	for(auto s : st){
		ll val = 0, cur = 1;
		for(int x=0;x<n;x++){
			val += convert(s[x]) * cur % mod;
			val %= mod;
			cur *= base;
			cur %= mod;
		}
		
//		cout << s << "\n";
		st2.insert(val);
	}
	
	int q;
	cin >> q;
	
	string t;
	cin >> t;
	
	tree.build(0, 0, n-1, t);
	
	if(st2.count(tree.query(0, 0, n-1, 0, n-1))){
		cout << "Yes\n";
	} else {
		cout << "No\n";
	}
	
	for(int i=1;i<=q;i++){
		int l, r;
		char c;
		cin >> l >> r >> c;
		
		l--; r--;
		tree.update(0, 0, n-1, l, r, convert(c));
		
		if(st2.count(tree.query(0, 0, n-1, 0, n-1))){
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
	
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:119:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |  for(int x=0;x<v.size();x++){
      |              ~^~~~~~~~~
Main.cpp:122:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |    for(int z=0;z<v[x].length();z++){
      |                ~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 860 KB Output is correct
2 Correct 83 ms 948 KB Output is correct
3 Correct 78 ms 896 KB Output is correct
4 Correct 65 ms 836 KB Output is correct
5 Correct 71 ms 900 KB Output is correct
6 Correct 89 ms 944 KB Output is correct
7 Correct 80 ms 836 KB Output is correct
8 Correct 73 ms 924 KB Output is correct
9 Correct 69 ms 904 KB Output is correct
10 Correct 84 ms 912 KB Output is correct
11 Correct 93 ms 808 KB Output is correct
12 Correct 73 ms 828 KB Output is correct
13 Correct 77 ms 800 KB Output is correct
14 Correct 70 ms 916 KB Output is correct
15 Correct 89 ms 824 KB Output is correct
16 Correct 74 ms 876 KB Output is correct
17 Correct 71 ms 840 KB Output is correct
18 Correct 84 ms 820 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 860 KB Output is correct
2 Correct 83 ms 948 KB Output is correct
3 Correct 78 ms 896 KB Output is correct
4 Correct 65 ms 836 KB Output is correct
5 Correct 71 ms 900 KB Output is correct
6 Correct 89 ms 944 KB Output is correct
7 Correct 80 ms 836 KB Output is correct
8 Correct 73 ms 924 KB Output is correct
9 Correct 69 ms 904 KB Output is correct
10 Correct 84 ms 912 KB Output is correct
11 Correct 93 ms 808 KB Output is correct
12 Correct 73 ms 828 KB Output is correct
13 Correct 77 ms 800 KB Output is correct
14 Correct 70 ms 916 KB Output is correct
15 Correct 89 ms 824 KB Output is correct
16 Correct 74 ms 876 KB Output is correct
17 Correct 71 ms 840 KB Output is correct
18 Correct 84 ms 820 KB Output is correct
19 Execution timed out 7034 ms 10200 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 860 KB Output is correct
2 Correct 83 ms 948 KB Output is correct
3 Correct 78 ms 896 KB Output is correct
4 Correct 65 ms 836 KB Output is correct
5 Correct 71 ms 900 KB Output is correct
6 Correct 89 ms 944 KB Output is correct
7 Correct 80 ms 836 KB Output is correct
8 Correct 73 ms 924 KB Output is correct
9 Correct 69 ms 904 KB Output is correct
10 Correct 84 ms 912 KB Output is correct
11 Correct 93 ms 808 KB Output is correct
12 Correct 73 ms 828 KB Output is correct
13 Correct 77 ms 800 KB Output is correct
14 Correct 70 ms 916 KB Output is correct
15 Correct 89 ms 824 KB Output is correct
16 Correct 74 ms 876 KB Output is correct
17 Correct 71 ms 840 KB Output is correct
18 Correct 84 ms 820 KB Output is correct
19 Correct 86 ms 888 KB Output is correct
20 Correct 93 ms 808 KB Output is correct
21 Correct 72 ms 836 KB Output is correct
22 Correct 68 ms 768 KB Output is correct
23 Correct 71 ms 808 KB Output is correct
24 Correct 71 ms 848 KB Output is correct
25 Correct 73 ms 872 KB Output is correct
26 Correct 67 ms 872 KB Output is correct
27 Correct 70 ms 836 KB Output is correct
28 Correct 68 ms 828 KB Output is correct
29 Correct 76 ms 964 KB Output is correct
30 Correct 68 ms 776 KB Output is correct
31 Correct 80 ms 840 KB Output is correct
32 Correct 72 ms 832 KB Output is correct
33 Correct 81 ms 804 KB Output is correct
34 Correct 75 ms 800 KB Output is correct
35 Correct 84 ms 912 KB Output is correct
36 Correct 86 ms 844 KB Output is correct
37 Correct 75 ms 920 KB Output is correct
38 Correct 79 ms 836 KB Output is correct
39 Correct 76 ms 896 KB Output is correct
40 Correct 78 ms 844 KB Output is correct
41 Correct 73 ms 836 KB Output is correct
42 Correct 82 ms 848 KB Output is correct
43 Correct 74 ms 880 KB Output is correct
44 Correct 82 ms 908 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 860 KB Output is correct
2 Correct 83 ms 948 KB Output is correct
3 Correct 78 ms 896 KB Output is correct
4 Correct 65 ms 836 KB Output is correct
5 Correct 71 ms 900 KB Output is correct
6 Correct 89 ms 944 KB Output is correct
7 Correct 80 ms 836 KB Output is correct
8 Correct 73 ms 924 KB Output is correct
9 Correct 69 ms 904 KB Output is correct
10 Correct 84 ms 912 KB Output is correct
11 Correct 93 ms 808 KB Output is correct
12 Correct 73 ms 828 KB Output is correct
13 Correct 77 ms 800 KB Output is correct
14 Correct 70 ms 916 KB Output is correct
15 Correct 89 ms 824 KB Output is correct
16 Correct 74 ms 876 KB Output is correct
17 Correct 71 ms 840 KB Output is correct
18 Correct 84 ms 820 KB Output is correct
19 Execution timed out 7034 ms 10200 KB Time limit exceeded
20 Halted 0 ms 0 KB -