Submission #3623196


Source Code Expand

/*
Character Drawing Adapted from FAKEUPDATE.NET
		   _    _____         _
		   \`,""   ,'7"r-..__/ \
		  ,'\ `, ,',','    _/   \
		 /   \, 7 / /     (   \ |
		J     \/ j  L______\  / |
		L   __JF"""/""\"\_,    /
		L,-"| O|  f O |  L_  _/
		F   \_ /  \__/   `-  j|
			.-'    `"""    ,' |          _..====.._
			\__/         r"_  A        ,' _..---.._`,
			 `-.______,,-L// / \  ___,' ,'_..:::.. `,`,
					  j   / / / 7"    `-<""=:'  '':. \ \
					 /   <,' /  F  . i , \   `,    :T W I
					 |    \,'  /    >X<  |     \   :| | L
					 |     `._/    ' ! ` |      I  :| |  G
					  \           \     /       |  :H T  |
					 __>-.__   __,-\   |        |  S P   |
					/     /|   | \  \  \_       | 'A R   |
				   /   __/ |   |  L  L   \      K./ /    L
				  /   |    |   4  I  I    |    E./ /   ,'
				 J    \    I    L F  I    |    // / _,'
		_________|     |   F    |J   F    |   //_/-'
		\   __   |    /   J     |/  J     |  /="
		\\  \_\  \__,' \  F     |   F     |
		\\\_____________\/      F__/      F
		 \\| 计算机编程 |_____/  (______/
		  \/从入门到入土/
*/
#include <iostream>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <sstream>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <map>
#include <climits>
#include <bitset>
#include <functional>
using namespace std;
int main(){
	ios::sync_with_stdio(false);
	int N, Q, x, i;
	bool flag = true;
	string	st = "kogakubu10gokan";
	cin >> N >> Q;
	for (i = 1; i <= N; ++i){
		cin >> x;
		if (x > Q){
			cout << st << endl;
			flag = false;
			goto endapp;
		}
		cin >> st;
	}
	if (flag)
		cout << st << endl;
endapp:
	//system("pause > nul");
	return 0;
}

Submission Info

Submission Time
Task A - 旧総合研究7号館
User luogu_bot1
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1743 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 43
Set Name Test Cases
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_small_0.txt, 10_small_1.txt, 10_small_2.txt, 10_small_3.txt, 10_small_4.txt, 10_small_5.txt, 10_small_6.txt, 10_small_7.txt, 10_small_8.txt, 10_small_9.txt, 20_large_0.txt, 20_large_1.txt, 20_large_2.txt, 20_large_3.txt, 20_large_4.txt, 20_large_5.txt, 20_large_6.txt, 20_large_7.txt, 20_large_8.txt, 20_large_9.txt, 30_random_0.txt, 30_random_1.txt, 30_random_2.txt, 30_random_3.txt, 30_random_4.txt, 30_random_5.txt, 30_random_6.txt, 30_random_7.txt, 30_random_8.txt, 30_random_9.txt, 40_max_0.txt, 40_max_1.txt, 40_max_2.txt, 40_max_3.txt, 40_max_4.txt, 40_max_5.txt, 40_max_6.txt, 40_max_7.txt, 40_max_8.txt, 40_max_9.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
10_small_0.txt AC 1 ms 256 KB
10_small_1.txt AC 1 ms 256 KB
10_small_2.txt AC 1 ms 256 KB
10_small_3.txt AC 1 ms 256 KB
10_small_4.txt AC 1 ms 256 KB
10_small_5.txt AC 1 ms 256 KB
10_small_6.txt AC 1 ms 256 KB
10_small_7.txt AC 1 ms 256 KB
10_small_8.txt AC 1 ms 256 KB
10_small_9.txt AC 1 ms 256 KB
20_large_0.txt AC 1 ms 256 KB
20_large_1.txt AC 1 ms 256 KB
20_large_2.txt AC 1 ms 256 KB
20_large_3.txt AC 1 ms 256 KB
20_large_4.txt AC 1 ms 256 KB
20_large_5.txt AC 1 ms 256 KB
20_large_6.txt AC 1 ms 256 KB
20_large_7.txt AC 1 ms 256 KB
20_large_8.txt AC 1 ms 256 KB
20_large_9.txt AC 1 ms 256 KB
30_random_0.txt AC 1 ms 256 KB
30_random_1.txt AC 1 ms 256 KB
30_random_2.txt AC 1 ms 256 KB
30_random_3.txt AC 1 ms 256 KB
30_random_4.txt AC 1 ms 256 KB
30_random_5.txt AC 1 ms 256 KB
30_random_6.txt AC 1 ms 256 KB
30_random_7.txt AC 1 ms 256 KB
30_random_8.txt AC 1 ms 256 KB
30_random_9.txt AC 1 ms 256 KB
40_max_0.txt AC 1 ms 256 KB
40_max_1.txt AC 1 ms 256 KB
40_max_2.txt AC 1 ms 256 KB
40_max_3.txt AC 1 ms 256 KB
40_max_4.txt AC 1 ms 256 KB
40_max_5.txt AC 1 ms 256 KB
40_max_6.txt AC 1 ms 256 KB
40_max_7.txt AC 1 ms 256 KB
40_max_8.txt AC 1 ms 256 KB
40_max_9.txt AC 1 ms 256 KB