結果
| 問題 |
No.161 制限ジャンケン
|
| コンテスト | |
| ユーザー |
femto
|
| 提出日時 | 2015-04-10 11:12:35 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 28 ms / 5,000 ms |
| コード長 | 4,175 bytes |
| コンパイル時間 | 1,011 ms |
| コンパイル使用メモリ | 110,208 KB |
| 実行使用メモリ | 19,200 KB |
| 最終ジャッジ日時 | 2024-11-30 04:32:00 |
| 合計ジャッジ時間 | 2,116 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 16 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;
class Solution {
int[,] hand;
void calc() {
hand = new int[2, 3];
rio(out hand[0, 0], out hand[0, 1], out hand[0, 2]);
var s = Console.ReadLine();
hand[1, 0] = s.Count(c => c == 'G');
hand[1, 1] = s.Count(c => c == 'C');
hand[1, 2] = s.Count(c => c == 'P');
int ans = 0;
for (int i = 0; i < 3; i++) {
int win = Math.Min(hand[0, i], hand[1, (i + 1) % 3]);
hand[0, i] -= win;
hand[1, (i + 1) % 3] -= win;
ans += 3 * win;
}
for (int i = 0; i < 3; i++) {
int drow = Math.Min(hand[0, i], hand[1, i]);
ans += drow;
}
Console.WriteLine(ans);
}
static void Main(string[] args) {
new Solution().calc();
}
#region
static int ri() { return int.Parse(Console.ReadLine()); }
static int[] ria(int n) {
if (n <= 0) { Console.ReadLine(); return new int[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
}
static void rio(out int p1) { p1 = ri(); }
static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static long rl() { return long.Parse(Console.ReadLine()); }
static long[] rla(int n) {
if (n <= 0) { Console.ReadLine(); return new long[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
}
static void rlo(out long p1) { p1 = rl(); }
static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static double rd() { return double.Parse(Console.ReadLine()); }
static double[] rda(int n) {
if (n <= 0) { Console.ReadLine(); return new double[0]; }
else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
}
static void rdo(out double p1) { p1 = rd(); }
static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
static void wa2<T>(T[][] a) {
foreach (var row in a) {
Debug.WriteLine(String.Join(" ", row));
}
}
[DebuggerDisplay("{x} , {y}")]
class point {
public int x, y;
public point(int x, int y) {
this.x = x; this.y = y;
}
}
#endregion
}
static class Extention {
public static T[][] ToJagArray<T>(this T[,] a) {
int n = a.GetLength(0), m = a.GetLength(1);
var ret = new T[n][];
for (int i = 0; i < n; i++) {
ret[i] = new T[m];
for (int j = 0; j < m; j++) {
ret[i][j] = a[i, j];
}
}
return ret;
}
}
femto