Submission #47880

ソースコード

?
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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
class Main {
private static final PrintWriter out = new PrintWriter(System.out);
private static final Scanner scanner = new Scanner(System.in);
private static int[] dx = {1, 0, -1, 0, 1, 1, -1, -1};
private static int[] dy = {0, 1, 0, -1, 1, -1, 1, -1};
private static int INF = 1 << 29;
public static void main(String[] args) {
// From IntelliJ IDEA
String s = fgetStr();
while ( !s.equals("-1") ) {
if ( s.contains("_WA") ) {
long n = Long.parseLong(s.replace("_WA", ""));
println( 2019 + n );
}
else {
long n = Long.parseLong(s);
println( n - 2019 + "_WA" );
}
s = fgetStr();
}
suomi();
}
private static boolean isMovable( int x, int y, int w, int h ) {
return ( x >= 0 && y >= 0 && x < w && y < h );
}
private static String fgetStr(){
return FastScanner.next();
}
private static String fgetLine(){
return FastScanner.nextLine();
}
private static char fgetChar(){
return fgetStr().charAt(0);
}
private static int fgetInt(){
return FastScanner.nextInt();
}
private static long fgetLong(){
return FastScanner.nextLong();
}
private static double fgetDouble(){
return FastScanner.nextDouble();
}
private static BigInteger fgetBig(){
return new BigInteger(fgetStr());
}
private static String reverseStr(String str){
return new StringBuffer(str).reverse().toString();
}
private static void println(Object a){
out.println(a);
}
private static void print(Object a){
out.print(a);
}
private static void printf(String string, Object... args) {
out.printf(string, args);
}
private static void suomi(){
out.flush();
}
private static long pow ( long x, long n ) {
final long MOD = 1000000007;
long ans = 1;
while ( n > 0 ) {
if ( ( n & 1 ) == 1 ) {
ans = (ans * x) % MOD;
}
x = ( x * x ) % MOD;
n >>= 1;
}
return ans;
}
private static long gcd(long x, long y) {
return x % y == 0 ? y : gcd(y, x % y);
}
private static long lcm(long x, long y) {
return ( x / gcd(x, y) * y);
}
}
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 bufferLength = 0;
private static boolean hasNextByte() {
if (ptr < bufferLength) {
return true;
}else{
ptr = 0;
try {
bufferLength = in.read(buffer);
} catch ( IOException e) {
e.printStackTrace();
}
if (bufferLength <= 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;
}
private static boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
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();
}
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();
}
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();
}
}
static int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
static double nextDouble() {
return Double.parseDouble(next());
}
}
class Pair<F, S> implements Comparable<Pair<F, S>> {
F first;
S second;
public Pair(F a, S b) {
this.first = a;
this.second = b;
}
@Override
public int compareTo(Pair<F, S> pair) {
int firstCmp = Objects.compare(this.first, pair.first, Comparator.comparing(Object::toString));
if ( firstCmp == 0 ) {
return Objects.compare(this.second, pair.second, Comparator.comparing(Object::toString));
}
return firstCmp;
}
public boolean equals(Pair<F, S> pair) {
return this.first.equals(pair.first) && this.second.equals(pair.second);
}
public String toString() {
return String.valueOf(first) + ", " + String.valueOf(second);
}
}
class Vector2 implements Comparable<Vector2> {
int x;
int y;
public Vector2(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public int compareTo(Vector2 vector2) {
return this.y - vector2.y == 0 ? this.x - vector2.x : this.y - vector2.y;
}
public boolean equals(Vector2 vector2) {
return this.y == vector2.y && this.x == vector2.x;
}
public String toString() {
return "y: " + this.y + ", x: " + this.x;
}
}
class UnionFind {
protected int[] data;
public UnionFind(int n) {
data = new int[n+1];
for (int i = 0; i < n; i++) {
data[i] = -1;
}
}
public boolean unite(int x, int y) {
int rootX = getRoot(x);
int rootY = getRoot(y);
if ( rootX == rootY ) return false;
if ( data[rootY] < data[rootX] ) {
int tmp = rootX;
rootX = rootY;
rootY = tmp;
}
data[rootX] += data[rootY];
data[rootY] = rootX;
return true;
}
public int getRoot(int i) {
return ( data[i] < 0 ) ? i : ( data[i] = getRoot(data[i]) );
}
public int getSize(int n) {
return -data[getRoot(n)];
}
public boolean isUnited(int x, int y) {
return getRoot(x) == getRoot(y);
}
}

ステータス

項目 データ
問題 1101 - 令和
ユーザー名 r1825
投稿日時 2019-04-01 22:27:42
言語 Java
状態 Accepted
得点 3
ソースコード長 7512 Byte
最大実行時間 305 ms
最大メモリ使用量 27668 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01 AC 234 ms 21340 KB
1
in02 AC 153 ms 21352 KB
1
in03 AC 166 ms 21652 KB
1
in04 AC 141 ms 21776 KB
1
in05 AC 178 ms 22056 KB
1
in06 AC 150 ms 22172 KB
1
in07 AC 150 ms 22028 KB
1
in08 AC 139 ms 22184 KB
1
in09 AC 182 ms 22160 KB
1
in10 AC 142 ms 19012 KB
1
in11 AC 159 ms 22232 KB
1
in12 AC 154 ms 22652 KB
1
in13 AC 154 ms 22596 KB
1
in14 AC 160 ms 22884 KB
1
in15 AC 170 ms 23232 KB
1
in16 AC 305 ms 26388 KB
1
in17 AC 158 ms 26184 KB
1
in18 AC 191 ms 27280 KB
1
in19 AC 145 ms 27280 KB
1
in20 AC 193 ms 27668 KB
1