제출 #236058

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236058		kartel	Programiranje (COCI17_programiranje)	C++14	80 / 80	38 ms	7648 KiB

programiranje

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int pr[N][30];
string s;
int i, j, n, a, b, c, d, q;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
////
//    in("input.txt");
//    out("output.txt");

    cin >> s;
    n = sz(s);

    for (i = 0; i < n; i++)
    {
        if (i > 0) for (j = 0; j < 26; j++) pr[i][j] = pr[i - 1][j];
        pr[i][s[i] - 'a']++;
    }

    cin >> q;

    while (q--)
    {
        cin >> a >> b >> c >> d;
        a--; c--;
        b--; d--;

        i = 0;
        while (i < 26)
        {
            if (pr[b][i] - ((a - 1 >= 0) ? pr[a - 1][i] : 0) != pr[d][i] - ((c - 1 >= 0) ? pr[c - 1][i] : 0)) break;
            i++;
        }

        if (i == 26) cout << "DA" << el;
                else cout << "NE" << el;
    }
}

//
//110000
//1100

• Subtask 1: 80 / 80