Submission #32549867
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() {
ll n;
cin >> n;
vector<ll> a(n);
REP(i,n){
cin >> a[i];
}
int count=0;
for(int i=n-1;i>=0;i--){
count += a[i];
if(count>=4){
cout << n-((n-1)-i) << endl;
return 0;
}
}
cout << 0 << endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Batters |
| User | takkey |
| Language | C++ (GCC 9.2.1) |
| Score | 200 |
| Code Size | 775 Byte |
| Status | AC |
| Exec Time | 18 ms |
| Memory | 3580 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 02_max_00.txt, 03_min_00.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 18 ms | 3524 KiB |
| 00_sample_01.txt | AC | 3 ms | 3548 KiB |
| 00_sample_02.txt | AC | 2 ms | 3496 KiB |
| 01_random_00.txt | AC | 2 ms | 3580 KiB |
| 01_random_01.txt | AC | 2 ms | 3448 KiB |
| 01_random_02.txt | AC | 2 ms | 3380 KiB |
| 01_random_03.txt | AC | 2 ms | 3528 KiB |
| 01_random_04.txt | AC | 2 ms | 3440 KiB |
| 02_max_00.txt | AC | 2 ms | 3556 KiB |
| 03_min_00.txt | AC | 2 ms | 3364 KiB |