AtCoder Beginner Contest 004

Submission #2691325

Source codeソースコード

#include <iostream>

using namespace std;
/*最初にNが与えられ、i = 0, 1 .... N - 1
 * 配列のi mod 5 + 1番目とi mod 5 + 2番目要素を入れ替える*/
int main(){
	int N;
	int array[] = {1, 2, 3, 4, 5, 6};
	cin >> N;
	for(int i = 0; i < N; i++){
		int a = i % 5;
		int b = i % 5 + 1;
		int tmp = array[a];
		array[a] = array[b];
		array[b] = tmp;
	}
	for(int i = 0; i < 6; i++) cout << array[i];
	cout << endl;
}

Submission

Task問題 C - 入れ替え
User nameユーザ名 ban
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 TLE
Score得点 30
Source lengthソースコード長 449 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Subtask1 30 / 30 SubTask1/00_sample_00.txt,SubTask1/00_sample_01.txt,SubTask1/00_sample_02.txt,SubTask1/rand_19.txt,SubTask1/rand_2.txt,SubTask1/rand_25.txt,SubTask1/rand_27.txt,SubTask1/rand_33.txt,SubTask1/rand_35.txt,SubTask1/rand_4.txt,SubTask1/rand_44.txt,SubTask1/rand_48.txt,SubTask1/rand_8.txt
Subtask2 0 / 70 SubTask2/00_sample_03.txt,SubTask2/max_case.txt,SubTask2/rand_120009641.txt,SubTask2/rand_134230520.txt,SubTask2/rand_136939465.txt,SubTask2/rand_200732473.txt,SubTask2/rand_211796835.txt,SubTask2/rand_312330341.txt,SubTask2/rand_377341731.txt,SubTask2/rand_384611280.txt,SubTask2/rand_386098102.txt,SubTask2/rand_399010727.txt,SubTask2/rand_409627453.txt,SubTask2/rand_416537730.txt,SubTask2/rand_425486442.txt,SubTask2/rand_493135174.txt,SubTask2/rand_573105326.txt,SubTask2/rand_62794810.txt,SubTask2/rand_649471654.txt,SubTask2/rand_693017484.txt,SubTask2/rand_729197057.txt,SubTask2/rand_759630883.txt,SubTask2/rand_823752210.txt,SubTask2/rand_830399384.txt,SubTask2/rand_893242387.txt,SubTask2/rand_935005824.txt,SubTask2/rand_989703310.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
SubTask1/00_sample_00.txt AC 1 ms 256 KB
SubTask1/00_sample_01.txt AC 1 ms 256 KB
SubTask1/00_sample_02.txt AC 1 ms 256 KB
SubTask1/rand_19.txt AC 1 ms 256 KB
SubTask1/rand_2.txt AC 1 ms 256 KB
SubTask1/rand_25.txt AC 1 ms 256 KB
SubTask1/rand_27.txt AC 1 ms 256 KB
SubTask1/rand_33.txt AC 1 ms 256 KB
SubTask1/rand_35.txt AC 1 ms 256 KB
SubTask1/rand_4.txt AC 1 ms 256 KB
SubTask1/rand_44.txt AC 1 ms 256 KB
SubTask1/rand_48.txt AC 1 ms 256 KB
SubTask1/rand_8.txt AC 1 ms 256 KB
SubTask2/00_sample_03.txt AC 332 ms 256 KB
SubTask2/max_case.txt TLE
SubTask2/rand_120009641.txt AC 398 ms 256 KB
SubTask2/rand_134230520.txt AC 445 ms 256 KB
SubTask2/rand_136939465.txt AC 454 ms 256 KB
SubTask2/rand_200732473.txt AC 664 ms 256 KB
SubTask2/rand_211796835.txt AC 701 ms 256 KB
SubTask2/rand_312330341.txt AC 1033 ms 256 KB
SubTask2/rand_377341731.txt AC 1247 ms 256 KB
SubTask2/rand_384611280.txt AC 1272 ms 256 KB
SubTask2/rand_386098102.txt AC 1277 ms 256 KB
SubTask2/rand_399010727.txt AC 1320 ms 256 KB
SubTask2/rand_409627453.txt AC 1356 ms 256 KB
SubTask2/rand_416537730.txt AC 1378 ms 256 KB
SubTask2/rand_425486442.txt AC 1407 ms 256 KB
SubTask2/rand_493135174.txt AC 1630 ms 256 KB
SubTask2/rand_573105326.txt AC 1905 ms 384 KB
SubTask2/rand_62794810.txt AC 209 ms 256 KB
SubTask2/rand_649471654.txt TLE
SubTask2/rand_693017484.txt TLE
SubTask2/rand_729197057.txt TLE
SubTask2/rand_759630883.txt TLE
SubTask2/rand_823752210.txt TLE
SubTask2/rand_830399384.txt TLE
SubTask2/rand_893242387.txt TLE
SubTask2/rand_935005824.txt TLE
SubTask2/rand_989703310.txt TLE