oj.uz

답안 #319873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319873 2020-11-06T16:04:02 Z ignaciocanta Programiranje (COCI17_programiranje) C++14
80 / 80
 60 ms 6816 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
 
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
 
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const int MX = 1e5+5;
const tint INF = 2e18;
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
 
void NACHO(string name = "moop"){
    ios_base::sync_with_stdio(0); cin.tie(0);
   // freopen((name+".in").c_str(), "r", stdin);
   // freopen((name+".in").c_str(), "w", stdout);
}
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

bool valid(int x, int y, int n, int m){
	return (0<=x && x<n && 0<=y && y<m);
}

int main(){
	NACHO();
	string s; cin >> s;
	int n = sz(s);
	vector<vi> words (26, vi (n+1, 0));
	forsn(i, 1, n+1){
		forn(j, 26){
			words[j][i] = words[j][i-1]+(s[i-1]-'a' == j);
		}
	}
	int q; cin >> q;
	forn(i, q){
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		bool ok = 1;
		forn(j, 26){
			if(words[j][r1]-words[j][l1-1] != words[j][r2]-words[j][l2-1]) ok = 0;
		}
		if(ok){
			cout << "DA" << "\n";
		}else cout << "NE" << "\n";
	}
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 52 ms 6816 KB Output is correct
7 Correct 55 ms 6816 KB Output is correct
8 Correct 60 ms 6816 KB Output is correct
9 Correct 53 ms 6816 KB Output is correct
10 Correct 52 ms 6816 KB Output is correct