結果
| 問題 |
No.565 回転拡大
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2017-09-08 23:01:45 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 3,741 bytes |
| コンパイル時間 | 4,637 ms |
| コンパイル使用メモリ | 106,496 KB |
| 実行使用メモリ | 20,096 KB |
| 最終ジャッジ日時 | 2024-11-07 06:40:30 |
| 合計ジャッジ時間 | 4,775 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 25 WA * 5 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;
//using System.Numerics;
class Program
{
static void Main()
{
//SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
new Program().solve();
Out.Flush();
}
Scanner cin = new Scanner();
Random rnd = new Random();
Stopwatch sw = new Stopwatch();
readonly int[] dd = { 0, 1, 0, -1, 0 };
readonly int mod = 1000000007;
readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
readonly string ALFA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int N;
int R, K, H, W;
char[,] A, D;
void solve()
{
R = cin.nextint;
K = cin.nextint;
H = cin.nextint;
W = cin.nextint;
var C = new string[H];
for (int i = 0; i < H; i++)
{
C[i] = cin.next;
}
if (R == 0)
{
A = new char[H, W];
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
A[i, j] = C[i][j];
}
}
}
else if (R == 90)
{
A = new char[W, H];
for (int i = 0; i < W; i++)
{
for (int j = 0; j < H; j++)
{
A[i, j] = C[H - j - 1][i];
}
}
}
else if (R == 180)
{
A = new char[H, W];
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
A[i, j] = C[H - i - 1][j];
}
}
}
else
{
A = new char[W, H];
for (int i = 0; i < W; i++)
{
for (int j = 0; j < H; j++)
{
A[i, j] = C[j][W - i - 1];
}
}
}
if (R == 0 || R == 180)
{
D = new char[H * K, W * K];
for (int i = 0; i < H * K; i++)
{
for (int j = 0; j < W * K; j++)
{
D[i, j] = A[i / K, j / K];
Write(D[i, j]);
}
WriteLine();
}
}
else
{
D = new char[W * K, H * K];
for (int i = 0; i < W * K; i++)
{
for (int j = 0; j < H * K; j++)
{
D[i, j] = A[i / K, j / K];
Write(D[i, j]);
}
WriteLine();
}
}
}
}
class Scanner
{
string[] s; int i;
char[] cs = new char[] { ' ' };
public Scanner() { s = new string[0]; i = 0; }
public string[] scan { get { return ReadLine().Split(); } }
public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
public string next
{
get
{
if (i < s.Length) return s[i++];
string st = ReadLine();
while (st == "") st = ReadLine();
s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
i = 0;
return next;
}
}
public int nextint { get { return int.Parse(next); } }
public long nextlong { get { return long.Parse(next); } }
public double nextdouble { get { return double.Parse(next); } }
}