oj.uz

답안 #36520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36520 2017-12-10T06:30:53 Z adamczh1 Programiranje (COCI17_programiranje) C++14
80 / 80
 39 ms 7228 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define SIZE(x) (int)((x).size())
inline int readi(){
	int x=0,f=1;char ch;ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int pre[26][50005];
int main(){
	string S; cin >> S;
	pre[S[0]-'a'][1]++;
	for(int i=1; i<SIZE(S); i++){
		for(int j=0;j<26;j++)pre[j][i+1]=pre[j][i];
		pre[S[i]-'a'][i+1]++;
	}
	int Q=readi();
	while(Q--){
		int A=readi(), B=readi(), C=readi(), D=readi();
		bool bad = 0;
		for(int i=0; i<26; i++){
			if(pre[i][B]-pre[i][A-1] != pre[i][D]-pre[i][C-1]){
				bad = 1;
			}
		}
		if(bad) puts("NE");
		else puts("DA");
	}
	return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7092 KB Output is correct
2 Correct 0 ms 7092 KB Output is correct
3 Correct 0 ms 7092 KB Output is correct
4 Correct 0 ms 7092 KB Output is correct
5 Correct 0 ms 7092 KB Output is correct
6 Correct 39 ms 7228 KB Output is correct
7 Correct 39 ms 7228 KB Output is correct
8 Correct 39 ms 7228 KB Output is correct
9 Correct 39 ms 7228 KB Output is correct
10 Correct 39 ms 7228 KB Output is correct