oj.uz

Submission #547094

# Submission time Handle Problem Language Result Execution time Memory
547094 2022-04-09T14:05:31 Z errorgorn Kemija (COCI22_kemija) C++17
50 / 50
 9 ms 468 KB 
// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

vector<char> parse(string s){
	int mul=1;
	if ('2'<=s[0] && s[0]<='9'){
		mul=s[0]-'0';
		s=s.substr(1,sz(s)-1);
	}
	
	s+='1';
	
	vector<char> res;
	char prev='0';
	for (auto it:s){
		if ('A' <= it && it <= 'Z'){
			if ('A'<=prev && prev<='Z') rep(zzz,0,mul) res.pub(prev);
		}
		else{
			if ('A'<=prev && prev<='Z') rep(z,0,it-'0') rep(zzz,0,mul) res.pub(prev);
		}
		prev=it;
	}
	
	sort(all(res));
	return res;
}

vector<char> solve(string s){
	int p=s.find('+');
	
	if (p==-1){
		return parse(s);
	}
	else{
		auto temp1=parse(s.substr(0,p));
		auto temp2=solve(s.substr(p+1,sz(s)-p-1));
		temp1.insert(end(temp1),all(temp2));
		sort(all(temp1));
		return temp1;
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	int TC;
	cin>>TC;
	while (TC--){
		string s;
		cin>>s;
		
		int p=s.find('>');
		if (solve(s.substr(0,p-1))==solve(s.substr(p+1,sz(s)-p-1))) cout<<"DA"<<endl;
		else cout<<"NE"<<endl;
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 5 ms 416 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 5 ms 424 KB Output is correct
9 Correct 5 ms 340 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 5 ms 416 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 5 ms 424 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 324 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 6 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct