oj.uz

답안 #426442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426442 2021-06-14T03:58:04 Z TLP39 Discharging (NOI20_discharging) C++14
100 / 100
 196 ms 17736 KB 
#include <stdio.h>
#include <math.h>
#include <utility>
#include <string.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair<ll,pair<ll,ll>> ppl;

ll n;
ll t[1000010]={};
vector<ppl> v;
int main()
{
    scanf("%lld",&n);
    t[0]=0;
    for(ll i=1;i<=n;i++)
    {
        scanf("%lld",&t[i]);
        t[i]=max(t[i],t[i-1]);
    }
    v.push_back({n+1,{t[n],0}});
    ll poi=0,a,b;
    ll res;
    for(ll i=n;i>0;i--)
    {
        res=v[poi].second.first*(n+1-i)+v[poi].second.second;
        if(t[i-1]==t[i])
        {
            while(poi!=v.size()-1 && v[poi+1].first>=i-1) poi++;
            continue;
        }
        while(!v.empty() && (v[v.size()-1].second.first-t[i-1])*(n+1-v[v.size()-1].first)>=res-v[v.size()-1].second.second)
        {
            v.pop_back();
        }
        a=(v[v.size()-1].second.first-t[i-1]);
        b=res-v[v.size()-1].second.second;
        v.push_back({n+1-(b+a-1)/a,{t[i-1],res}});
        if(i-1<=v[v.size()-1].first) poi=v.size()-1;
        while(poi!=v.size()-1 && v[poi+1].first>=i-1) poi++;
    }
    printf("%lld",v[v.size()-1].second.second);
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:34:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |             while(poi!=v.size()-1 && v[poi+1].first>=i-1) poi++;
      |                   ~~~^~~~~~~~~~~~
Discharging.cpp:45:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         while(poi!=v.size()-1 && v[poi+1].first>=i-1) poi++;
      |               ~~~^~~~~~~~~~~~
Discharging.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
Discharging.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%lld",&t[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 127 ms 13160 KB Output is correct
17 Correct 130 ms 13972 KB Output is correct
18 Correct 153 ms 12484 KB Output is correct
19 Correct 133 ms 13856 KB Output is correct
20 Correct 142 ms 13700 KB Output is correct
21 Correct 131 ms 13764 KB Output is correct
22 Correct 129 ms 13404 KB Output is correct
23 Correct 134 ms 14452 KB Output is correct
24 Correct 132 ms 14032 KB Output is correct
25 Correct 142 ms 14308 KB Output is correct
26 Correct 144 ms 14660 KB Output is correct
27 Correct 124 ms 13124 KB Output is correct
28 Correct 158 ms 14020 KB Output is correct
29 Correct 131 ms 14148 KB Output is correct
30 Correct 148 ms 14364 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 17692 KB Output is correct
2 Correct 150 ms 17736 KB Output is correct
3 Correct 146 ms 17732 KB Output is correct
4 Correct 167 ms 17700 KB Output is correct
5 Correct 138 ms 17680 KB Output is correct
6 Correct 139 ms 17696 KB Output is correct
7 Correct 141 ms 17724 KB Output is correct
8 Correct 196 ms 17700 KB Output is correct
9 Correct 165 ms 17736 KB Output is correct
10 Correct 139 ms 17660 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 308 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 352 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 304 KB Output is correct

Subtask #6
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 127 ms 13160 KB Output is correct
31 Correct 130 ms 13972 KB Output is correct
32 Correct 153 ms 12484 KB Output is correct
33 Correct 133 ms 13856 KB Output is correct
34 Correct 142 ms 13700 KB Output is correct
35 Correct 131 ms 13764 KB Output is correct
36 Correct 129 ms 13404 KB Output is correct
37 Correct 134 ms 14452 KB Output is correct
38 Correct 132 ms 14032 KB Output is correct
39 Correct 142 ms 14308 KB Output is correct
40 Correct 144 ms 14660 KB Output is correct
41 Correct 124 ms 13124 KB Output is correct
42 Correct 158 ms 14020 KB Output is correct
43 Correct 131 ms 14148 KB Output is correct
44 Correct 148 ms 14364 KB Output is correct
45 Correct 143 ms 17692 KB Output is correct
46 Correct 150 ms 17736 KB Output is correct
47 Correct 146 ms 17732 KB Output is correct
48 Correct 167 ms 17700 KB Output is correct
49 Correct 138 ms 17680 KB Output is correct
50 Correct 139 ms 17696 KB Output is correct
51 Correct 141 ms 17724 KB Output is correct
52 Correct 196 ms 17700 KB Output is correct
53 Correct 165 ms 17736 KB Output is correct
54 Correct 139 ms 17660 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 304 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 308 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 352 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 1 ms 204 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 1 ms 304 KB Output is correct
76 Correct 124 ms 14080 KB Output is correct
77 Correct 122 ms 14088 KB Output is correct
78 Correct 123 ms 13436 KB Output is correct
79 Correct 121 ms 13792 KB Output is correct
80 Correct 136 ms 14460 KB Output is correct
81 Correct 121 ms 13628 KB Output is correct
82 Correct 141 ms 13508 KB Output is correct
83 Correct 140 ms 14016 KB Output is correct
84 Correct 142 ms 13880 KB Output is correct
85 Correct 122 ms 14156 KB Output is correct
86 Correct 118 ms 13524 KB Output is correct
87 Correct 117 ms 13440 KB Output is correct
88 Correct 118 ms 13892 KB Output is correct
89 Correct 162 ms 13628 KB Output is correct
90 Correct 139 ms 13508 KB Output is correct
91 Correct 120 ms 13340 KB Output is correct
92 Correct 134 ms 14636 KB Output is correct
93 Correct 125 ms 13892 KB Output is correct
94 Correct 116 ms 12980 KB Output is correct
95 Correct 150 ms 14360 KB Output is correct
96 Correct 115 ms 13332 KB Output is correct
97 Correct 118 ms 13688 KB Output is correct
98 Correct 120 ms 13756 KB Output is correct
99 Correct 133 ms 13532 KB Output is correct
100 Correct 117 ms 13508 KB Output is correct