답안 #1006413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006413	2024-06-24T01:48:22 Z	christinelynn	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	4444 KB

segments

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll,ll> 
#define pii pair<int,int> 
#define vl vector<ll> 
#define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll maxn = 5e5+7, modn1 = 1e9+7, modn2 = 998244353;
using namespace std;

// kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!!
// Kalo emang soalnya susah, pindah soal dulu 
// Jangan sampe diem, pikirin sesuatu, pasti bisa!!!
// Cobain semua approach, jangan ngestuck di satu pemikiran
// Jangan overthinking, jangan panik, tenangin pikiranmu

ll t,n;
ll a[maxn], pref[maxn],pos[maxn],dp[maxn];

void solve() {
  cin>>n;
  for (ll i=1; i<=n; i++) {
    cin>>a[i];
    pref[i] = a[i] + pref[i-1];
  }
  ll cur = 0;
  for (ll i=1; i<=n; i++) {
    pos[i] = cur;
    while (pref[i] - pref[cur] >= pref[cur] - pref[pos[cur]]) {
      cur++;
    }
     if (pos[i] != cur) {
       cur--;
       pos[i] = cur;
     }
    dp[i] = dp[pos[i]] + 1;
  }
  /*for (ll i=1; i<=n; i++) {
    cout<<dp[i]<<" ";
  }
  cout<<endl;
  for (ll i=1; i<=n; i++) {
    cout<<pos[i]<<" ";
  }*/
  cout<<dp[n];
}


int main () {
  nikah
  t = 1;
//  cin>>t;
  while (t--) {
    solve();
  //  cout<<endl;
  }
}

Subtask #1

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	0 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	0 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	0 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Incorrect	1 ms	4444 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	0 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	0 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	0 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Incorrect	1 ms	4444 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	0 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	0 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	0 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Incorrect	1 ms	4444 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	0 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	0 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	0 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Incorrect	1 ms	4444 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	0 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	0 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	0 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Incorrect	1 ms	4444 KB	Output isn't correct
13	Halted	0 ms	0 KB	-