Submission #24291733
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;
int main() {
int n;
string s;
cin>>n>>s;
REP(i,n){
if(s[i]=='1'){
if(i%2==0){
cout << "Takahashi" << endl;
return 0 ;
}else{
cout << "Aoki" << endl;
return 0 ;
}
}
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Bouzu Mekuri |
| User | takkey |
| Language | C++ (GCC 9.2.1) |
| Score | 200 |
| Code Size | 754 Byte |
| Status | AC |
| Exec Time | 8 ms |
| Memory | 3760 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | example0.txt, example1.txt |
| All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, example0.txt, example1.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 000.txt | AC | 6 ms | 3412 KiB |
| 001.txt | AC | 1 ms | 3492 KiB |
| 002.txt | AC | 7 ms | 3664 KiB |
| 003.txt | AC | 8 ms | 3760 KiB |
| 004.txt | AC | 7 ms | 3680 KiB |
| 005.txt | AC | 7 ms | 3728 KiB |
| 006.txt | AC | 2 ms | 3588 KiB |
| 007.txt | AC | 2 ms | 3680 KiB |
| 008.txt | AC | 2 ms | 3540 KiB |
| 009.txt | AC | 7 ms | 3732 KiB |
| 010.txt | AC | 5 ms | 3684 KiB |
| example0.txt | AC | 2 ms | 3600 KiB |
| example1.txt | AC | 4 ms | 3496 KiB |