This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using namespace chrono;
//using namespace atcoder
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define vc vector<char>
#define vd vector<double>
#define vld vector<long double>
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define f first
#define s second
#define pii pair<int , int>
#define pll pair<ll , ll>
#define pil pair<int , ll>
#define pli pair<ll , int>
#define psi pair<string , int>
#define pci pair<char , int>
#define pic pair<int , char>
#define pis pair<int , string>
#define psl pair<string , ll>
#define pcl pair<char , ll>
#define plc pair<ll , char>
#define pls pair<ll , string>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ins insert
#define END return 0
#define mod 1e9
#define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) (x).begin() , (x).end()
#define oo 1e9
#define Size(x) x.size()
/*
int gcd(int number1 , int number2){
if(number2 == 0){
return number1;
}
return gcd(number2 , number1 % number2);
}
int lcm(int number1 , int number2){
return number1 / gcd(number1 , number2) * number2;
}
ll fact(int number){
ll product = 1;
for(int i=2 ; i<=number ; i++){
product *= i;
}
return product;
}
*/
//#define int ll
void solve(){
string s;
cin >> s;
map<char , int> L1 , L2;
bool c = false;
for(int i=0 ; i<Size(s) ; i++){
if(s[i] == '-' && s[i+1] == '>'){
c = true;
}
else if(s[i] != '+' && s[i] != '>' && s[i] != '-'){
if(c == false){
L1[s[i]]++;
}
else{
L2[s[i]]++;
}
}
}
if(L1.size() == L2.size()){
auto ind1 = L1.begin() , ind2 = L2.begin();
while(ind1 != L1.end()){
if(ind1->s != ind2->s || ind1->f != ind2->f){
cout << "NE\n";
return;
}
++ind1; ++ind2;
}
cout << "DA\n";
}
else cout << "NE\n";
}
/*signed */ int main(){
speed;
int t = 1;
cin >> t;
while(t--){
solve();
}
END;
}
Compilation message (stderr)
Main.cpp: In function 'void solve()':
Main.cpp:83:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for(int i=0 ; i<Size(s) ; i++){
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |