Submission #37862

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
class Main{
static final Scanner in = new Scanner(System.in);
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String args[]){
String key = fgetStr();
String str = fgetStr();
str = str + str;
if ( str.contains(key) || reverseStr(str).contains(key) ) {
iprint("YES");
}
else iprint("NO");
ifin();
}
static String fgetStr(){
return FastScanner.next();
}
static String fgetLine(){
return FastScanner.nextLine();
}
static char fgetChar(){
return fgetStr().charAt(0);
}
static int fgetInt(){
return FastScanner.nextInt();
}
static long fgetLong(){
return FastScanner.nextLong();
}
static double fgetDouble(){
return FastScanner.nextDouble();
}
static BigInteger getBig(){
return in.nextBigInteger();
}
static String reverseStr(String str){
StringBuffer sb = new StringBuffer(str);
return sb.reverse().toString();
}
static void iprint(Object a){
out.println(a);
}
static void iprintf(Object a){
out.print(a);
}
static void ifin(){
out.flush();
}
static int upperBound(int[] a, int n, int val){
int low = 0;
int hi = n;
while ( low < hi ) {
int mid = (low+hi) / 2;
if ( a[mid] <= val ) low = mid + 1;
else hi = mid;
}
return low;
}
static int lowerBound(int[] a, int n, int val){
int low = 0;
int hi = n;
while ( low < hi ) {
int mid = (low+hi) / 2;
if ( a[mid] < val ) low = mid + 1;
else hi = mid;
}
return low;
}
/*
@Deprecated
static String getStr(){
return in.next();
}
@Deprecated
static String getLine(){
return in.nextLine();
}
@Deprecated
static int getInt(){
return Integer.parseInt(getStr());
}
@Deprecated
static long getLong(){
return Long.parseLong(getStr());
}
@Deprecated
static double getDouble(){
return Double.parseDouble(getStr());
}
@Deprecated
static void print(Object a){
System.out.println(a);
}
@Deprecated
static void printf(Object a){
System.out.print(a);
}*/
}
class FastScanner {
private static final InputStream in = System.in;
private static final byte[] buffer = new byte[1024];
private static int ptr = 0;
private static int buflen = 0;
private static boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private static int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public static boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public static String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public static String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b) || b == 32) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public static long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public static int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public static double nextDouble() { return Double.parseDouble(next());}
}
/*
class UnionFind {
private int[] parent;
private int[] rank;
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;
}
}
public void union(int x, int y) {
int rootX = find(x);
int rootY = find(y);
if (rank[rootX] > rank[rootY]) {
parent[rootY] = rootX;
} else if(rank[rootX] < rank[rootY]) {
parent[rootX] = rootY;
} else if (rootX != rootY){
parent[rootY] = rootX;
rank[rootX]++;
}
}
private int find(int i) {
if (i != parent[i]) {
parent[i] = find(parent[i]);
}
return parent[i];
}
public boolean isSame(int x, int y) {
return find(x) == find(y);
}
}*/

ステータス

項目 データ
問題 0938 - 魔剤が飲みたい
ユーザー名 r1825
投稿日時 2018-06-21 21:28:41
言語 Java
状態 Accepted
得点 1
ソースコード長 6145 Byte
最大実行時間 105 ms
最大メモリ使用量 15008 KB

セット

セット 得点 Cases
1 ALL 1 / 1 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
case1.txt AC 103 ms 14888 KB
1
case2.txt AC 93 ms 14592 KB
1
reverse1.txt AC 96 ms 15008 KB
1
reverse2.txt AC 98 ms 14804 KB
1
test1.txt AC 97 ms 13292 KB
1
test2.txt AC 89 ms 13608 KB
1
test3.txt AC 105 ms 14216 KB
1