제출 #919512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919512		jpfr12	Nizin (COCI16_nizin)	C++17	100 / 100	61 ms	10320 KiB

nizin

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
 
//classes

 
 
//global
vector<ll> vec;

int sol(int left, int right){
  int ans = 0;
  while(left < right){
    if(vec[left] == vec[right]){
      left++;
      right--;
    }
    else{
      if(vec[left] > vec[right]){
        vec[right-1] += vec[right];
        right--;
      }
      else{
        vec[left+1] += vec[left];
        left++;
      }
      ans++;
    }
  }
  return ans;
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("input.txt");
  //ofstream fout("output.txt");
  //stop
  int n;
  cin >> n;
  vec.resize(n);
  for(ll& i: vec) cin >> i;
  cout << sol(0, n-1) << '\n';
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10