結果
問題 | No.740 幻の木 |
ユーザー |
![]() |
提出日時 | 2018-10-06 15:46:40 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 3,075 bytes |
コンパイル時間 | 2,142 ms |
コンパイル使用メモリ | 78,272 KB |
実行使用メモリ | 38,148 KB |
最終ジャッジ日時 | 2024-10-12 13:49:52 |
合計ジャッジ時間 | 3,204 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 6 |
ソースコード
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStream;import java.io.InputStreamReader;import java.io.OutputStream;import java.io.PrintWriter;import java.util.InputMismatchException;import java.util.StringTokenizer;public class Main {public static void main(String[] args) throws IOException {InputStream inputStream = System.in;OutputStream outputStream = System.out;InputReader in = new InputReader(inputStream);PrintWriter out = new PrintWriter(outputStream);TaskX solver = new TaskX();solver.solve(1, in, out);out.close();}static int INF = 1 << 30;static long LINF = 1L << 55;static int MOD = 1000000007;static int[] mh4 = { 0, -1, 1, 0 };static int[] mw4 = { -1, 0, 0, 1 };static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };static class TaskX {public void solve(int testNumber, InputReader in, PrintWriter out) {int n = in.nextInt(), m = in.nextInt(), p = in.nextInt() % 12, q = in.nextInt();int ans = 0;int count = 0;for (int i = 1; i <= n && count < n; i++) {int now = i % 12 == 0 ? 12 : i % 12;if (p <= now && now <= p + q - 1) {count += m;}count += m;ans++;}out.println(ans);}}static class InputReader {BufferedReader in;StringTokenizer tok;public String nextString() {while (!tok.hasMoreTokens()) {try {tok = new StringTokenizer(in.readLine(), " ");} catch (IOException e) {throw new InputMismatchException();}}return tok.nextToken();}public int nextInt() {return Integer.parseInt(nextString());}public long nextLong() {return Long.parseLong(nextString());}public double nextDouble() {return Double.parseDouble(nextString());}public int[] nextIntArray(int n) {int[] res = new int[n];for (int i = 0; i < n; i++) {res[i] = nextInt();}return res;}public int[] nextIntArrayDec(int n) {int[] res = new int[n];for (int i = 0; i < n; i++) {res[i] = nextInt() - 1;}return res;}public int[] nextIntArray1Index(int n) {int[] res = new int[n + 1];for (int i = 0; i < n; i++) {res[i + 1] = nextInt();}return res;}public long[] nextLongArray(int n) {long[] res = new long[n];for (int i = 0; i < n; i++) {res[i] = nextLong();}return res;}public long[] nextLongArrayDec(int n) {long[] res = new long[n];for (int i = 0; i < n; i++) {res[i] = nextLong() - 1;}return res;}public long[] nextLongArray1Index(int n) {long[] res = new long[n + 1];for (int i = 0; i < n; i++) {res[i + 1] = nextLong();}return res;}public double[] nextDoubleArray(int n) {double[] res = new double[n];for (int i = 0; i < n; i++) {res[i] = nextDouble();}return res;}public InputReader(InputStream inputStream) {in = new BufferedReader(new InputStreamReader(inputStream));tok = new StringTokenizer("");}}}