oj.uz

Submission #525692

# Submission time Handle Problem Language Result Execution time Memory
525692 2022-02-12T14:40:17 Z BackNoob Programiranje (COCI17_programiranje) C++14
80 / 80
 36 ms 6596 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 1e5 + 7;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

int n , q;
string s;
int pre[mxN][26];

void solve()
{
	cin >> s;

	for(int i = 1 ; i <= sz(s) ; i++) pre[i][s[i - 1] - 'a']++;

	for(int j = 0 ; j < 26 ; j++)
	for(int i = 1 ; i <= sz(s) ; i++) pre[i][j] += pre[i - 1][j];

	cin >> q;
	while(q--) {
		int l , r , u , v;
		cin >> l >> r >> u >> v;

		bool ok = true;
		for(int i = 0 ; i < 26 ; i++) {
			if(pre[r][i] - pre[l - 1][i] != pre[v][i] - pre[u - 1][i]) ok = false;
		}
		if(ok) cout << "DA" << endl;
		else cout << "NE" << endl;
	}

}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".in" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
    
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 25 ms 6436 KB Output is correct
7 Correct 29 ms 6504 KB Output is correct
8 Correct 35 ms 6596 KB Output is correct
9 Correct 28 ms 6432 KB Output is correct
10 Correct 36 ms 6440 KB Output is correct