# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236237 | Vimmer | Programiranje (COCI17_programiranje) | C++14 | 136 ms | 7724 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 50001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int pr[N][30];
int get(int l, int r, int j) {return pr[r][j] - (l == 0 ? 0 : pr[l - 1][j]);}
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
cin >> s;
int n = sz(s);
for (int i = 0; i < n; i++)
if (s[i] - 'a' < 0) s[i] = char('a' + s[i] - 'A');
for (int j = 0; j < 30; j++)
{
char c = char('a' + j);
for (int i = 0; i < n; i++)
{
if (c == s[i]) pr[i][j]++;
if (i != 0) pr[i][j] += pr[i - 1][j];
}
}
int q;
cin >> q;
for (; q > 0; q--)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
a--; b--; c--; d--;
bool bad = 0;
for (int j = 0; j < 30; j++)
if (get(a, b, j) != get(c, d, j)) {bad = 1; break;}
if (bad) {cout << "NE" << endl; continue;}
cout << "DA" << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |