답안 #937381

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937381	2024-03-04T01:50:59 Z	stefanneagu	Money (IZhO17_money)	C++17	9 / 100	1 ms	600 KB

money

#include <bits/stdc++.h>

using namespace std;

const int nmax = 1e5 + 1;

int v[nmax], dp[nmax];

int main() {
  int n;
  cin >> n;
  vector<vector<int>> srt(n + 1);
  srt[0].push_back(0);
  for(int i = 1; i <= n; i ++) {
    cin >> v[i];
    srt[i] = srt[i - 1];
    srt[i].push_back(v[i]);
    sort(srt[i].begin(), srt[i].end());
    dp[i] = 1e9;
  }
  dp[1] = 1;
  for(int i = 2; i <= n; i ++) {
    if(v[i] < v[i - 1]) {
      break;
    }
    dp[i] = 1;
  }
  for(int i = 2; i <= n;  i ++) {
    int j = i;
    int x = upper_bound(srt[i - 1].begin(), srt[i - 1].end(), v[i]) - srt[i - 1].begin();
    while(true) {
      dp[j] = min(dp[j], dp[i - 1] + 1);
      j ++;
      if(j == n + 1 || v[j] < v[j - 1] || v[j] > srt[i - 1][x]) {
        break;
      }
    }
    // cout << i << ": " << dp[i] << '\n';
  }
  cout << dp[n];
  return 0;
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	448 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	448 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Incorrect	1 ms	452 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	448 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Incorrect	1 ms	452 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	448 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	452 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Incorrect	1 ms	452 KB	Output isn't correct
18	Halted	0 ms	0 KB	-