Submission #4034031


Source Code Expand

#define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include<bits/stdc++.h>
using namespace std;
#define hi cerr<<"hi"<<endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define mp make_pair
#define rev reverse
#define dans dump(ans)
#define MOD 1000000007
#define amp(v,n) (v).count(n)?v[n]++:v[n]=1
#define sysp system("pause")
#define PI acos(-1)
#define pf push_front
#define ins insert

//{
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class...A> inline void dump(){cout<<endl;}
template<class...A> inline void dump_rest() {cout<<endl;}
template<class T, class...A> inline void dump_rest(const T& first, const A&... rest){cout<<dump_interval<<first;dump_rest(rest...);}
template<class T,class...A> inline void dump(const T&first,const A&...rest){cout<<first;dump_rest(rest...);}
template<class...A> inline void debug(){cerr<<endl;}
template<class...A> inline void debug_rest() {cerr<<endl;}
template<class T, class...A> inline void debug_rest(const T& first, const A&... rest){cerr<<debug_interval<<first;debug_rest(rest...);}
template<class T,class...A> inline void debug(const T&first,const A&...rest){if(debug_toggle)cerr<<first,debug_rest(rest...);}
unsigned XorShift(void){static unsigned x = 123456789;static unsigned y = 362436069;static unsigned z = 521288629;static unsigned w = 88675123;unsigned t;t = x ^ (x << 11);x = y; y = z; z = w;return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));}
//}

typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
template<int m>class mint{private:int i;public:mint() : i(0){}mint(int i): i((i%m+m)%m){}mint operator+(const mint& o){return o.i+i;}mint operator*(const mint& o){return o.i*i;}mint operator-(){return -i;}operator int() {return i;}};

//}

main(){
    string s;
    cin>>s;
    int n=s.size();
    if(s[0]==s.back()){
        if(n%2)dump("Second");
        else dump("First");
    }else{
        if(n%2)dump("First");
        else dump("Second");
    }
}

Submission Info

Submission Time
Task D - An Ordinary Game
User masu1208
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2519 Byte
Status AC
Exec Time 5 ms
Memory 512 KB

Compile Error

./Main.cpp:9:0: warning: "INT_MAX" redefined
 #define INT_MAX LLONG_MAX
 ^
In file included from /usr/include/c++/5/climits:41:0,
                 from /usr/include/x86_64-linux-gnu/c++/5/bits/stdc++.h:39,
                 from ./Main.cpp:5:
/usr/lib/gcc/x86_64-linux-gnu/5/include-fixed/limits.h:120:0: note: this is the location of the previous definition
 #define INT_MAX __INT_MAX__
 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 49
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
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 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 5 ms 512 KB
1_07.txt AC 5 ms 512 KB
1_08.txt AC 5 ms 512 KB
1_09.txt AC 4 ms 512 KB
1_10.txt AC 5 ms 512 KB
1_11.txt AC 4 ms 512 KB
1_12.txt AC 4 ms 512 KB
1_13.txt AC 4 ms 512 KB
1_14.txt AC 4 ms 512 KB
1_15.txt AC 4 ms 512 KB
1_16.txt AC 4 ms 512 KB
1_17.txt AC 4 ms 512 KB
1_18.txt AC 4 ms 512 KB
1_19.txt AC 4 ms 512 KB
1_20.txt AC 4 ms 512 KB
1_21.txt AC 4 ms 512 KB
1_22.txt AC 4 ms 512 KB
1_23.txt AC 4 ms 512 KB
1_24.txt AC 4 ms 512 KB
1_25.txt AC 4 ms 512 KB
1_26.txt AC 4 ms 512 KB
1_27.txt AC 4 ms 512 KB
1_28.txt AC 4 ms 512 KB
1_29.txt AC 4 ms 512 KB
1_30.txt AC 4 ms 512 KB
1_31.txt AC 4 ms 512 KB
1_32.txt AC 4 ms 512 KB
1_33.txt AC 4 ms 512 KB
1_34.txt AC 4 ms 512 KB
1_35.txt AC 4 ms 512 KB
1_36.txt AC 4 ms 512 KB
1_37.txt AC 4 ms 512 KB
1_38.txt AC 4 ms 512 KB
1_39.txt AC 4 ms 512 KB
1_40.txt AC 4 ms 512 KB
1_41.txt AC 4 ms 512 KB
1_42.txt AC 4 ms 512 KB
1_43.txt AC 4 ms 512 KB
1_44.txt AC 4 ms 512 KB
1_45.txt AC 4 ms 512 KB