Submission #1248566

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool a[1000000010];
int main() {
	int n; cin >> n;
	long maxk = 0;
	for (int i = 0; i < n; i++){
		long k; cin >> k;
		while (k % 2 == 0)k /= 2;
		maxk = max(maxk, k);
		a[k] = true;
	}
	long sum = 0;
	for (int i = 1; i <= maxk; i += 2)
		if (a[i])sum++;
	cout << sum << endl;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User th90tk297
Language C++14 (GCC 5.4.1)
Score 30
Code Size 373 Byte
Status MLE
Exec Time 612 ms
Memory 975360 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 0 / 20 30 / 30 0 / 50
Status
AC × 3
AC × 14
MLE × 9
AC × 13
AC × 25
MLE × 18
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask2 subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 1 ms 256 KB
subtask0_1.txt AC 1 ms 256 KB
subtask0_2.txt AC 1 ms 256 KB
subtask1_0.txt AC 2 ms 256 KB
subtask1_1.txt AC 3 ms 768 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt MLE 574 ms 854784 KB
subtask1_12.txt MLE 565 ms 903680 KB
subtask1_13.txt MLE 531 ms 903680 KB
subtask1_14.txt MLE 531 ms 903680 KB
subtask1_15.txt MLE 532 ms 903808 KB
subtask1_16.txt MLE 532 ms 903680 KB
subtask1_17.txt MLE 532 ms 903680 KB
subtask1_18.txt MLE 536 ms 907776 KB
subtask1_19.txt MLE 556 ms 948608 KB
subtask1_2.txt AC 3 ms 768 KB
subtask1_3.txt AC 3 ms 768 KB
subtask1_4.txt AC 3 ms 768 KB
subtask1_5.txt AC 3 ms 768 KB
subtask1_6.txt AC 3 ms 768 KB
subtask1_7.txt AC 3 ms 768 KB
subtask1_8.txt AC 3 ms 768 KB
subtask1_9.txt AC 3 ms 768 KB
subtask2_0.txt AC 38 ms 384 KB
subtask2_1.txt AC 41 ms 768 KB
subtask2_2.txt AC 41 ms 768 KB
subtask2_3.txt AC 41 ms 768 KB
subtask2_4.txt AC 41 ms 768 KB
subtask2_5.txt AC 42 ms 768 KB
subtask2_6.txt AC 47 ms 768 KB
subtask2_7.txt AC 41 ms 768 KB
subtask2_8.txt AC 41 ms 896 KB
subtask2_9.txt AC 41 ms 768 KB
subtask3_0.txt AC 38 ms 384 KB
subtask3_1.txt MLE 609 ms 963456 KB
subtask3_2.txt MLE 599 ms 963328 KB
subtask3_3.txt MLE 612 ms 975232 KB
subtask3_4.txt MLE 600 ms 975232 KB
subtask3_5.txt MLE 598 ms 975232 KB
subtask3_6.txt MLE 602 ms 975232 KB
subtask3_7.txt MLE 598 ms 975360 KB
subtask3_8.txt MLE 599 ms 975232 KB
subtask3_9.txt MLE 598 ms 975232 KB