結果

問題 No.769 UNOシミュレータ
ユーザー YukimotoPGYukimotoPG
提出日時 2019-03-11 14:03:05
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,069 bytes
コンパイル時間 2,742 ms
コンパイル使用メモリ 81,032 KB
実行使用メモリ 132,868 KB
最終ジャッジ日時 2024-11-22 09:12:35
合計ジャッジ時間 38,071 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 85 ms
114,964 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 TLE -
testcase_21 TLE -
testcase_22 AC 92 ms
132,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {

	void solve (FastScanner in, PrintWriter out) {
		
		int n = in.nextInt(), m = in.nextInt();
		LinkedList<String> turn = new LinkedList<>();
		for (int i=0; i<m; i++) {
			turn.add(in.next());
		}
		int drawNum = 0;
		for (int i=0; i<m; i++) {
			if (turn.get(i).equals("drawtwo")) drawNum += 2;
			else if (drawNum > 0) {
				turn.add(i, String.valueOf(drawNum));
				drawNum = 0;
			}
		}
		drawNum = 0;
		for (int i=0; i<m; i++) {
			if (turn.get(i).equals("drawfour")) drawNum += 4;
			else if (drawNum > 0) {
				turn.add(i, String.valueOf(drawNum));
				drawNum = 0;
			}
		}
		
		
//		turn.forEach(e->System.out.println(e));
		
		int next = 0; //次は誰の番か
		int[] num = new int[n]; //i番目の参加者は何枚カードを持っているか
		int[] draw = new int[n];
		boolean reverse = false;
		
		for (int i=0; i<turn.size(); i++) {
			
			char c = turn.get(i).charAt(0);
			if ('0'<=c && c<='9') {
				draw[next] += Integer.parseInt(turn.get(i));
				if (reverse == true) next = Math.max(next-1, (next-1+n)%n);
				else next = Math.min(next+1, (next+1)%n);
				continue;
			}
			num[next]++;
			
//			out.println((next+1)+" "+draw[1]+" "+num[1]);
			
			if (i == turn.size()-1) break;
			
			

			if (turn.get(i).equals("skip")) {
				if (reverse == true) next = Math.max(next-2, (next-2+n)%n);
				else next = Math.min(next+2, (next+2)%n);
				
			}
			else if (turn.get(i).equals("reverse")) {
				if (reverse == true) {
					next = Math.min(next+1, (next+1)%n);
					reverse = false;
				}
				else if (reverse == false){
					next = Math.max(next-1, (next-1+n)%n);
					reverse = true;
				}
			}
			else {
				if (reverse == true) next = Math.max(next-1, (next-1+n)%n);
				else next = Math.min(next+1, (next+1)%n);
			}
			
			
//			0 1 2 3 4 5
		}
		
		
		out.println((next+1)+" "+(num[next]-draw[next]));

	}



	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