Submission #1436986


Source Code Expand

//
//  main.cpp
//  atcoder 009b tournament
//
//  Created by zhangdenny on 2017/7/18.
//  Copyright © 2017年 Kirito. All rights reserved.
//

#include  <functional>
#include  <algorithm>
#include  <exception>
#include  <stdexcept>
#include  <streambuf>
#include  <iterator>
#include  <string.h>
#include  <stdlib.h>
#include  <typeinfo>
#include  <valarray>
#include  <iostream>
#include  <sstream>
#include  <istream>
#include  <stdio.h>
#include  <climits>
#include  <clocale>
#include  <complex>
#include  <csetjmp>
#include  <csignal>
#include  <cstdarg>
#include  <cstddef>
#include  <ctype.h>
#include  <cassert>
#include  <cstdlib>
#include  <utility>
#include  <cstring>
#include  <numeric>
#include  <ostream>
#include  <cwctype>
#include  <fstream>
#include  <iomanip>
#include  <math.h>
#include  <bitset>
#include  <cctype>
#include  <string>
#include  <vector>
#include  <limits>
#include  <locale>
#include  <memory>
#include  <cerrno>
#include  <iosfwd>
#include  <cfloat>
#include  <cstdio>
#include  <cwchar>
#include  <cmath>
#include  <ctime>
#include  <deque>
#include  <queue>
#include  <stack>
#include  <list>
#include  <ios>
#include  <map>
#include  <set>
#include  <new>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define pii pair<int,int>
using namespace std;
const int maxn=100005;
int n,co,c1,a[maxn];
vector<int> v[maxn];
ll mul2()
{
    ll k=1,sum=1,m=0;
    while(m<co)
    {
        sum*=2;
        m=sum-1;
        k++;
    }
    return k;
}
int main()
{
    cin>>n;
    int i=0;
    while(scanf("%d",a+i)!=EOF)
    {
        cin>>a[i];
        if(a[i]==1)
            c1++;
        else
            co++;
    }
    ll ans=mul2();
    if(ans>=c1)
        cout<<ans+1;
    else
        cout<<c1+1;
    return 0;
}

Submission Info

Submission Time
Task B - Tournament
User vjudge1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1783 Byte
Status WA
Exec Time 26 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
WA × 1
AC × 7
WA × 46
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 24 ms 2560 KB
02.txt WA 25 ms 2560 KB
03.txt WA 25 ms 2560 KB
04.txt WA 24 ms 2560 KB
05.txt WA 25 ms 2560 KB
06.txt WA 25 ms 2560 KB
07.txt WA 24 ms 2560 KB
08.txt WA 25 ms 2560 KB
09.txt WA 25 ms 2560 KB
10.txt WA 24 ms 2560 KB
11.txt WA 25 ms 2560 KB
12.txt WA 25 ms 2560 KB
13.txt WA 25 ms 2560 KB
14.txt WA 26 ms 2560 KB
15.txt WA 25 ms 2560 KB
16.txt WA 25 ms 2560 KB
17.txt WA 26 ms 2560 KB
18.txt WA 25 ms 2560 KB
19.txt WA 25 ms 2560 KB
20.txt WA 25 ms 2560 KB
21.txt WA 16 ms 2560 KB
22.txt WA 15 ms 2560 KB
23.txt WA 16 ms 2560 KB
24.txt WA 15 ms 2560 KB
25.txt WA 15 ms 2560 KB
26.txt WA 17 ms 2560 KB
27.txt WA 17 ms 2560 KB
28.txt WA 18 ms 2560 KB
29.txt WA 20 ms 2560 KB
30.txt WA 20 ms 2560 KB
31.txt WA 25 ms 2560 KB
32.txt WA 25 ms 2560 KB
33.txt WA 24 ms 2560 KB
34.txt WA 25 ms 2560 KB
35.txt WA 23 ms 2560 KB
36.txt WA 22 ms 2560 KB
37.txt WA 23 ms 2560 KB
38.txt WA 20 ms 2560 KB
39.txt WA 19 ms 2560 KB
40.txt WA 18 ms 2560 KB
41.txt AC 2 ms 2560 KB
42.txt WA 2 ms 2560 KB
43.txt AC 2 ms 2560 KB
44.txt WA 2 ms 2560 KB
45.txt AC 2 ms 2560 KB
46.txt AC 2 ms 2560 KB
47.txt WA 2 ms 2560 KB
48.txt AC 2 ms 2560 KB
49.txt WA 2 ms 2560 KB
50.txt WA 2 ms 2560 KB
s1.txt AC 2 ms 2560 KB
s2.txt WA 2 ms 2560 KB
s3.txt AC 2 ms 2560 KB