Submission #996995


Source Code Expand

#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>

#define FOR(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)

using namespace std;

int main() {
	int x, p;
	cin >> x >> p;
	assert(p == 100);
	if (p == 100) {
		int tim = (x+1) / 2;
		cout << tim << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task A - Takahashi is Missing!
User peradfn1126
Language C++14 (GCC 5.4.1)
Score 200
Code Size 792 Byte
Status RE
Exec Time 117 ms
Memory 384 KB

Judge Result

Set Name Sample Dataset1 Dataset2 Dataset3
Score / Max Score 0 / 0 200 / 200 0 / 300 0 / 200
Status
AC × 1
RE × 2
AC × 7
AC × 4
RE × 6
AC × 7
RE × 16
Set Name Test Cases
Sample subtask_01_ex1.txt, subtask_03_ex2.txt, subtask_04_ex3.txt
Dataset1 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt
Dataset2 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt
Dataset3 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_ex3.txt
Case Name Status Exec Time Memory
subtask_01_02.txt AC 3 ms 256 KB
subtask_01_03.txt AC 3 ms 256 KB
subtask_01_04.txt AC 2 ms 256 KB
subtask_01_ex1.txt AC 2 ms 256 KB
subtask_02_01.txt AC 2 ms 256 KB
subtask_02_02.txt AC 3 ms 256 KB
subtask_02_03.txt AC 2 ms 256 KB
subtask_03_01.txt RE 111 ms 256 KB
subtask_03_02.txt RE 113 ms 256 KB
subtask_03_03.txt RE 114 ms 256 KB
subtask_03_04.txt RE 113 ms 256 KB
subtask_03_05.txt RE 111 ms 256 KB
subtask_03_ex2.txt RE 113 ms 256 KB
subtask_04_01.txt RE 113 ms 256 KB
subtask_04_02.txt RE 113 ms 256 KB
subtask_04_03.txt RE 117 ms 384 KB
subtask_04_04.txt RE 113 ms 256 KB
subtask_04_05.txt RE 113 ms 256 KB
subtask_04_06.txt RE 113 ms 256 KB
subtask_04_07.txt RE 112 ms 256 KB
subtask_04_08.txt RE 115 ms 256 KB
subtask_04_09.txt RE 112 ms 256 KB
subtask_04_ex3.txt RE 112 ms 256 KB