답안 #1058446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058446	2024-08-14T10:02:06 Z	SzymonKrzywda	Bikeparking (EGOI24_bikeparking)	C++17	25 / 100	68 ms	5092 KB

Main

#include <bits/stdc++.h>

using namespace std;


int main()
{
    int n;
    cin >> n;
    
    vector<int> tier_(n);
    vector<int> lvl_(n);
    
    for (int i=0; i<n; i++) cin >> tier_[i];
    for (int i=0; i<n; i++) cin >> lvl_[i];
    
    
    vector<int> tier(n);
    vector<int> lvl(n);
    for (int i=0; i<n; i++) tier[i] = tier_[i];
    for (int i=0; i<n; i++) lvl[i] = lvl_[i];
    
    
    int akt_wsk=n-1;
    int wynik = 0,wynik_;
    for (int i=n-1; i>=0; i--){
        
        while (akt_wsk >= 0 && tier[akt_wsk]==0) akt_wsk--;
        while (akt_wsk>=0 && lvl[i]>0){
            while (akt_wsk>=0 && akt_wsk>=i) akt_wsk--;
            if (akt_wsk>=i) break;
            int mini = min(tier[akt_wsk],lvl[i]);
            tier[akt_wsk]-=mini;
            lvl[i]-=mini;
            wynik+=mini;
            while (akt_wsk >= 0 && tier[akt_wsk]==0) akt_wsk--;
        }
        
    }
    
    akt_wsk=n-1;
    
    for (int i=0; i<n; i++){
        if (lvl[i]>0){
            int mini = min(tier[i],lvl[i]);
            tier[i] -= mini;
            lvl[i] -= mini;
            while (lvl[i]>0){
                while (akt_wsk >= 0 && tier[akt_wsk]==0) akt_wsk--;
                int mini = min(tier[akt_wsk],lvl[i]);
                tier[i] -= mini;
                lvl[i] -= mini;
                wynik-=mini;
            }
        }
    }
    
    wynik_=wynik;
    //sposob drugi
    
       
    for (int i=0; i<n; i++) tier[i] = tier_[i];
    for (int i=0; i<n; i++) lvl[i] = lvl_[i];
    akt_wsk=0;
    wynik = 0;
    
    
    for (int i=0; i<n; i++){
        
        while (akt_wsk<i && lvl[i]>0){
            int mini = min(tier[akt_wsk],lvl[i]);
            tier[akt_wsk]-=mini;
            lvl[i]-=mini;
            wynik+=mini;
            if (tier[akt_wsk]==0) akt_wsk++;
            while (akt_wsk < n && tier[akt_wsk]==0) akt_wsk++;
        }
        
    }
    
    akt_wsk=n-1;
    
    for (int i=0; i<n; i++){
        if (lvl[i]>0){
            int mini = min(tier[i],lvl[i]);
            tier[i] -= mini;
            lvl[i] -= mini;
            while (lvl[i]>0){
                while (akt_wsk >= 0 && tier[akt_wsk]==0) akt_wsk--;
                int mini = min(tier[akt_wsk],lvl[i]);
                tier[i] -= mini;
                lvl[i] -= mini;
                wynik-=mini;
            }
        }
    }
    
    
    wynik_=max(wynik,wynik_);
    
    cout << wynik_ << endl;
    
    return 0;
}

Subtask #1

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	344 KB	Output is correct
6	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	408 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct

Subtask #2

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	48 ms	5088 KB	Output is correct
6	Correct	56 ms	4948 KB	Output is correct
7	Correct	68 ms	4944 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #3

0.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	43 ms	5092 KB	Output is correct
3	Correct	52 ms	5092 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	55 ms	5072 KB	Output is correct
11	Incorrect	50 ms	4948 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	344 KB	Output is correct
6	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	408 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	404 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Incorrect	0 ms	348 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	344 KB	Output is correct
6	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	408 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	48 ms	5088 KB	Output is correct
27	Correct	56 ms	4948 KB	Output is correct
28	Correct	68 ms	4944 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	43 ms	5092 KB	Output is correct
34	Correct	52 ms	5092 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	55 ms	5072 KB	Output is correct
42	Incorrect	50 ms	4948 KB	Output isn't correct
43	Halted	0 ms	0 KB	-