oj.uz

Submission #670439

# Submission time Handle Problem Language Result Execution time Memory
670439 2022-12-09T06:00:05 Z PoPularPlusPlus Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 2896 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

string merge(string s , string t){
	for(int i = 0; i < (int)s.size(); i++){
		if(s[i] != t[i]){
			if(s[i]!='J' && t[i] != 'J')s[i] = 'J';
			else if(s[i]!='O' && t[i] != 'O')s[i] = 'O';
			else s[i] = 'I';
		}
	}
	return s;
}

void solve(){
	int n;
	cin >> n;
	string a,b,c;
	cin >> a >> b >> c;
	map<string,int> m;
	m[a] = 1;
	m[b] = 1;
	m[c] = 1;
	vector<string> v;
	v.pb(a);
	v.pb(b);
	v.pb(c);
	for(int i = 0; i < (int)v.size(); i++){
		for(int j = 0; j < (int)v.size(); j++){
			string s = merge(v[i],v[j]);
			if(m[s] == 1)continue;
			v.pb(s);
			m[s] = 1;
		}
	}
	assert(v.size() < 20);
	int q;
	cin >> q;
	string s;
	cin >> s;
	string ans = "No";
	for(int i = 0; i < (int)v.size(); i++){
		if(s == v[i]){
			ans = "Yes";
			break;
		}
	}
	cout << ans << '\n';
	while(q--){
		int l , r;
		cin >> l >> r;
		char tp;
		cin >> tp;
		for(int i = l - 1; i <= r - 1; i++){
			s[i] = tp;
		}
		ans = "No";
		for(int i = 0; i < (int)v.size(); i++){
			if(s == v[i]){
				ans = "Yes";
				break;
			}
		}
		cout << ans << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 788 KB Output is correct
2 Correct 48 ms 872 KB Output is correct
3 Correct 79 ms 848 KB Output is correct
4 Correct 47 ms 840 KB Output is correct
5 Correct 46 ms 848 KB Output is correct
6 Correct 47 ms 796 KB Output is correct
7 Correct 46 ms 820 KB Output is correct
8 Correct 48 ms 872 KB Output is correct
9 Correct 48 ms 896 KB Output is correct
10 Correct 50 ms 812 KB Output is correct
11 Correct 47 ms 844 KB Output is correct
12 Correct 48 ms 888 KB Output is correct
13 Correct 47 ms 812 KB Output is correct
14 Correct 47 ms 844 KB Output is correct
15 Correct 46 ms 852 KB Output is correct
16 Correct 47 ms 828 KB Output is correct
17 Correct 47 ms 844 KB Output is correct
18 Correct 81 ms 856 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 788 KB Output is correct
2 Correct 48 ms 872 KB Output is correct
3 Correct 79 ms 848 KB Output is correct
4 Correct 47 ms 840 KB Output is correct
5 Correct 46 ms 848 KB Output is correct
6 Correct 47 ms 796 KB Output is correct
7 Correct 46 ms 820 KB Output is correct
8 Correct 48 ms 872 KB Output is correct
9 Correct 48 ms 896 KB Output is correct
10 Correct 50 ms 812 KB Output is correct
11 Correct 47 ms 844 KB Output is correct
12 Correct 48 ms 888 KB Output is correct
13 Correct 47 ms 812 KB Output is correct
14 Correct 47 ms 844 KB Output is correct
15 Correct 46 ms 852 KB Output is correct
16 Correct 47 ms 828 KB Output is correct
17 Correct 47 ms 844 KB Output is correct
18 Correct 81 ms 856 KB Output is correct
19 Execution timed out 7103 ms 2896 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 788 KB Output is correct
2 Correct 48 ms 872 KB Output is correct
3 Correct 79 ms 848 KB Output is correct
4 Correct 47 ms 840 KB Output is correct
5 Correct 46 ms 848 KB Output is correct
6 Correct 47 ms 796 KB Output is correct
7 Correct 46 ms 820 KB Output is correct
8 Correct 48 ms 872 KB Output is correct
9 Correct 48 ms 896 KB Output is correct
10 Correct 50 ms 812 KB Output is correct
11 Correct 47 ms 844 KB Output is correct
12 Correct 48 ms 888 KB Output is correct
13 Correct 47 ms 812 KB Output is correct
14 Correct 47 ms 844 KB Output is correct
15 Correct 46 ms 852 KB Output is correct
16 Correct 47 ms 828 KB Output is correct
17 Correct 47 ms 844 KB Output is correct
18 Correct 81 ms 856 KB Output is correct
19 Correct 55 ms 812 KB Output is correct
20 Correct 87 ms 860 KB Output is correct
21 Correct 51 ms 816 KB Output is correct
22 Correct 43 ms 844 KB Output is correct
23 Correct 49 ms 844 KB Output is correct
24 Correct 45 ms 788 KB Output is correct
25 Correct 50 ms 844 KB Output is correct
26 Correct 44 ms 832 KB Output is correct
27 Correct 49 ms 852 KB Output is correct
28 Correct 42 ms 764 KB Output is correct
29 Correct 49 ms 860 KB Output is correct
30 Correct 44 ms 760 KB Output is correct
31 Correct 55 ms 860 KB Output is correct
32 Correct 53 ms 912 KB Output is correct
33 Correct 56 ms 852 KB Output is correct
34 Correct 49 ms 864 KB Output is correct
35 Correct 58 ms 832 KB Output is correct
36 Correct 57 ms 900 KB Output is correct
37 Correct 55 ms 856 KB Output is correct
38 Correct 52 ms 844 KB Output is correct
39 Correct 55 ms 808 KB Output is correct
40 Correct 55 ms 844 KB Output is correct
41 Correct 59 ms 828 KB Output is correct
42 Correct 54 ms 844 KB Output is correct
43 Correct 54 ms 832 KB Output is correct
44 Correct 55 ms 900 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 788 KB Output is correct
2 Correct 48 ms 872 KB Output is correct
3 Correct 79 ms 848 KB Output is correct
4 Correct 47 ms 840 KB Output is correct
5 Correct 46 ms 848 KB Output is correct
6 Correct 47 ms 796 KB Output is correct
7 Correct 46 ms 820 KB Output is correct
8 Correct 48 ms 872 KB Output is correct
9 Correct 48 ms 896 KB Output is correct
10 Correct 50 ms 812 KB Output is correct
11 Correct 47 ms 844 KB Output is correct
12 Correct 48 ms 888 KB Output is correct
13 Correct 47 ms 812 KB Output is correct
14 Correct 47 ms 844 KB Output is correct
15 Correct 46 ms 852 KB Output is correct
16 Correct 47 ms 828 KB Output is correct
17 Correct 47 ms 844 KB Output is correct
18 Correct 81 ms 856 KB Output is correct
19 Execution timed out 7103 ms 2896 KB Time limit exceeded
20 Halted 0 ms 0 KB -