結果

問題 No.769 UNOシミュレータ
ユーザー YukimotoPGYukimotoPG
提出日時 2019-03-11 14:32:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 329 ms / 2,000 ms
コード長 3,866 bytes
コンパイル時間 2,650 ms
コンパイル使用メモリ 79,108 KB
実行使用メモリ 75,116 KB
最終ジャッジ日時 2024-05-02 00:32:24
合計ジャッジ時間 7,959 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 93 ms
52,500 KB
testcase_01 AC 81 ms
38,220 KB
testcase_02 AC 87 ms
37,820 KB
testcase_03 AC 87 ms
37,724 KB
testcase_04 AC 99 ms
38,108 KB
testcase_05 AC 109 ms
39,596 KB
testcase_06 AC 107 ms
40,016 KB
testcase_07 AC 103 ms
38,420 KB
testcase_08 AC 99 ms
39,600 KB
testcase_09 AC 154 ms
42,020 KB
testcase_10 AC 158 ms
41,924 KB
testcase_11 AC 153 ms
41,552 KB
testcase_12 AC 201 ms
48,696 KB
testcase_13 AC 201 ms
48,952 KB
testcase_14 AC 206 ms
48,428 KB
testcase_15 AC 268 ms
56,348 KB
testcase_16 AC 270 ms
55,468 KB
testcase_17 AC 271 ms
55,328 KB
testcase_18 AC 324 ms
66,524 KB
testcase_19 AC 325 ms
75,116 KB
testcase_20 AC 323 ms
65,756 KB
testcase_21 AC 329 ms
74,996 KB
testcase_22 AC 90 ms
38,864 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {

	void solve (FastScanner in, PrintWriter out) {
		
		int n = in.nextInt(), m = in.nextInt();
		String[] turn = in.nextArray(m);
		
//		turn.forEach(e->System.out.println(e));
		
		int next = 0; //次は誰の番か
		int[] num = new int[n]; //i番目の参加者は何枚カードを持っているか
		int[] draw = new int[n];
		boolean reverse = false;
		int draw2Num = 0; //draw2の蓄積
		int draw4Num = 0;
		
		for (int i=0; i<m; i++) {
			
			num[next]++;
			if (i == m-1) break;
			
			
//			out.println((next+1)+" "+draw[2]+" "+num[2]);
			if (turn[i].equals("drawtwo")) {
				draw2Num += 2;
				if (i!=m-1 && !turn[i+1].equals("drawtwo")) {
					next = nextTurn(next, 1, n, reverse);
//					out.println((next+1)+" "+draw[2]+" "+num[2]);
					draw[next] += draw2Num;
					draw2Num = 0;
				}
			}
			else if (turn[i].equals("drawfour")) {
				draw4Num += 4;
				if (i!=m-1 && !turn[i+1].equals("drawfour")) {
					next = nextTurn(next, 1, n, reverse);
//					out.println((next+1)+" "+draw[2]+" "+num[2]);
					draw[next] += draw4Num;
					draw4Num = 0;
				}
			}

			
			

			if (turn[i].equals("skip")) {
				next = nextTurn(next, 2, n, reverse);
			}
			else if (turn[i].equals("reverse")) {
				reverse = reverse==true? false : true;
				next = nextTurn(next, 1, n, reverse);
			}
			else {
				next = nextTurn(next, 1, n, reverse);
			}
		}
		
		
		out.println((next+1)+" "+(num[next]-draw[next]));

	}
	
	static int nextTurn (int now, int move, int num, boolean b) {
		int result = 0;
		if (b == true) {
			return Math.max(now-move, (now-move+num)%num);
		}
		else {
			return Math.min(now+move, (now+move)%num);
		}
	}



	public static void main(String[] args) {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Main main = new Main();
		main.solve(in, out);
		in.close();
		out.close();
	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}
		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}
		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}
		public boolean isPrintable (int n) {return 33<=n&&n<=126;}
		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}
		public boolean hasNext () {skip(); return hasNextByte();}
		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}
		public String[] nextArray (int n) {
			String[] ar = new String[n];
			for (int i=0; i<n; i++) ar[i] = next();
			return ar;
		}
		public int nextInt () {return Math.toIntExact(nextLong());}
		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}
		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}
		public double nextDouble () {
			return Double.parseDouble(next());
		}
		public void close () {
			try {in.close();}
			catch(Exception e){}
		}
	}

}
0