Submission #8521107


Source Code Expand

Copy
#include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int N,a[MAXN];
bool candetermine(int x,int y)
{
    return (a[x+1]<y+1);
}
int main()
{
    scanf("%d",&N);
    for(int i=1;i<=N;i++) scanf("%d",&a[i]);
    sort(a+1,a+N+1,greater<int>());
    int id=-1;
    for(int i=1;i<=N;i++)
    {
        if(candetermine(i,i))
        {
            int cnt1=(a[i]-i),cnt2=0;
            for(int j=i+1;j<=N;j++) if(a[j]>=i) cnt2++;
            if(cnt1%2==0&&cnt2%2==0) puts("Second"); else puts("First");
            return 0;
        }
    }
    return 0;
}

Submission Info

Submission Time
Task E - Candy Piles
User Roundgod
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 720 Byte
Status AC
Exec Time 17 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:18:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=N;i++) scanf("%d",&a[i]);
                                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 3
AC × 55
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 10 ms 640 KB
1_04.txt AC 10 ms 640 KB
1_05.txt AC 10 ms 640 KB
1_06.txt AC 10 ms 640 KB
1_07.txt AC 10 ms 640 KB
1_08.txt AC 10 ms 640 KB
1_09.txt AC 12 ms 640 KB
1_10.txt AC 13 ms 640 KB
1_11.txt AC 14 ms 640 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 14 ms 512 KB
1_14.txt AC 8 ms 384 KB
1_15.txt AC 14 ms 512 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 17 ms 640 KB
1_18.txt AC 16 ms 640 KB
1_19.txt AC 17 ms 640 KB
1_20.txt AC 17 ms 640 KB
1_21.txt AC 14 ms 512 KB
1_22.txt AC 17 ms 640 KB
1_23.txt AC 5 ms 384 KB
1_24.txt AC 3 ms 256 KB
1_25.txt AC 5 ms 384 KB
1_26.txt AC 2 ms 256 KB
1_27.txt AC 13 ms 512 KB
1_28.txt AC 7 ms 384 KB
1_29.txt AC 3 ms 256 KB
1_30.txt AC 13 ms 512 KB
1_31.txt AC 17 ms 640 KB
1_32.txt AC 7 ms 384 KB
1_33.txt AC 3 ms 256 KB
1_34.txt AC 14 ms 512 KB
1_35.txt AC 4 ms 384 KB
1_36.txt AC 14 ms 512 KB
1_37.txt AC 13 ms 512 KB
1_38.txt AC 16 ms 640 KB
1_39.txt AC 15 ms 640 KB
1_40.txt AC 13 ms 512 KB
1_41.txt AC 2 ms 256 KB
1_42.txt AC 6 ms 384 KB
1_43.txt AC 10 ms 512 KB
1_44.txt AC 1 ms 256 KB
1_45.txt AC 3 ms 256 KB
1_46.txt AC 12 ms 512 KB
1_47.txt AC 15 ms 640 KB
1_48.txt AC 7 ms 384 KB
1_49.txt AC 10 ms 512 KB
1_50.txt AC 7 ms 384 KB
1_51.txt AC 16 ms 640 KB