oj.uz

답안 #654965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654965 2022-11-02T09:06:28 Z Bliznetc Programiranje (COCI17_programiranje) C++17
80 / 80
 26 ms 5836 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC target("avx2")

using namespace std;

#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define F first
#define S second

typedef pair < int, int > pii;
typedef vector < int >  vi;
typedef vector < vi >  vvi;

int pref[100100][27];

void solve(){
    string s;
    cin >> s;
    int n = s.sz;
    s = '+' + s;
    for (int i = 1; i <= n; i++) {
        pref[i][s[i] - 'a'] = 1;
        for (int j = 0; j < 26; j++) {
            pref[i][j] += pref[i - 1][j];
        }
    }

    int q;
    cin >> q;
    while (q--) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        bool ok = 1;
        for (int i = 0; i <= 25; i++) {
            ok &= (pref[b][i] - pref[a - 1][i] == pref[d][i] - pref[c - 1][i]);
        }
        cout << (ok == 1 ? "DA" : "NE") << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
        cout << "\n";
    }
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 22 ms 5768 KB Output is correct
7 Correct 22 ms 5776 KB Output is correct
8 Correct 21 ms 5744 KB Output is correct
9 Correct 22 ms 5836 KB Output is correct
10 Correct 26 ms 5788 KB Output is correct