답안 #156415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156415	2019-10-05T14:31:09 Z	Moses	Go (COCI16_go)	C++14	0 / 50	2 ms	452 KB

go

// Created by AboAbdoMC
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long

using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;

const int OO = 1e9+7;
const int MOD = 1e9+7;
const int N = 1e5+7;

int a[N];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    rep(i,n) cin >> a[i];
    int i = 0;
    int j = n-1;
    int ans = 0;
    while(i < j)
    {
    	if (a[i] == a[j])
    	{
    		i++;
    		j--;
    		continue;
    	}
    	if (a[i] < a[j])
    	{
    		a[i+1]+=a[i];
    		i++;
    		ans++;
    		continue;
    	}
    	if (a[j] < a[i])
    	{
    		a[j-1]+=a[j];
    		j--;
    		ans++;
    		continue;
    	}
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1

0.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	376 KB	Output isn't correct
2	Incorrect	2 ms	376 KB	Output isn't correct
3	Incorrect	2 ms	376 KB	Output isn't correct
4	Incorrect	2 ms	452 KB	Output isn't correct
5	Incorrect	2 ms	376 KB	Output isn't correct
6	Incorrect	2 ms	376 KB	Output isn't correct
7	Incorrect	2 ms	376 KB	Output isn't correct
8	Incorrect	2 ms	376 KB	Output isn't correct
9	Incorrect	2 ms	376 KB	Output isn't correct
10	Incorrect	2 ms	376 KB	Output isn't correct
11	Incorrect	2 ms	376 KB	Output isn't correct
12	Incorrect	2 ms	376 KB	Output isn't correct
13	Incorrect	2 ms	376 KB	Output isn't correct
14	Incorrect	2 ms	376 KB	Output isn't correct
15	Incorrect	2 ms	376 KB	Output isn't correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Incorrect	2 ms	376 KB	Output isn't correct
18	Incorrect	2 ms	380 KB	Output isn't correct
19	Incorrect	2 ms	376 KB	Output isn't correct
20	Incorrect	2 ms	376 KB	Output isn't correct
21	Incorrect	2 ms	376 KB	Output isn't correct
22	Incorrect	2 ms	376 KB	Output isn't correct
23	Incorrect	2 ms	376 KB	Output isn't correct
24	Incorrect	2 ms	376 KB	Output isn't correct
25	Incorrect	2 ms	376 KB	Output isn't correct