답안 #1114911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1114911	2024-11-19T18:26:53 Z	AdamGS	Fire (JOI20_ho_t5)	C++17	1 / 100	1000 ms	18364 KB

ho_t5

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAX=2*1e5+7;

ll ogien[MAX];
ll odp[MAX];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    ll n, q, t, l, r;
    cin >> n >> q;

    vector<pair<pair<ll, ll>, pair<ll, ll>>> zapytania;

    for (int i=0; i<n; i++){
        cin >> ogien[i+1];
    }

    for (int i=0; i<q; i++){
        cin >> t >> l >> r;
        zapytania.push_back({{t, i}, {l, r}});
    }

    sort(zapytania.begin(), zapytania.end());

    ll it = 0;
    for (int i=1; i<=n; i++){
        for(int j=n; j>0; --j) ogien[j] = max(ogien[j-1], ogien[j]);
        while(zapytania[it].first.first==i){
            ll suma=0;
            for (int j=zapytania[it].second.first; j<=zapytania[it].second.second; j++) suma += ogien[j];
            odp[zapytania[it].first.second] = suma;
            it++;
        }
    }

    for (int i=0; i<q; i++) cout << odp[i] << "\n";

    return 0;
}

Subtask #1

1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	2 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2552 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2552 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2384 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	1 ms	2384 KB	Output is correct
22	Correct	1 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	1 ms	2384 KB	Output is correct
25	Correct	1 ms	2384 KB	Output is correct
26	Correct	1 ms	2384 KB	Output is correct
27	Correct	1 ms	2384 KB	Output is correct
28	Correct	2 ms	2384 KB	Output is correct
29	Correct	1 ms	2384 KB	Output is correct
30	Correct	1 ms	2384 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	2 ms	2384 KB	Output is correct

Subtask #2

0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Execution timed out	1034 ms	18364 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #3

0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Execution timed out	1041 ms	17312 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1050 ms	16792 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	2 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2552 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2552 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2384 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	1 ms	2384 KB	Output is correct
22	Correct	1 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	1 ms	2384 KB	Output is correct
25	Correct	1 ms	2384 KB	Output is correct
26	Correct	1 ms	2384 KB	Output is correct
27	Correct	1 ms	2384 KB	Output is correct
28	Correct	2 ms	2384 KB	Output is correct
29	Correct	1 ms	2384 KB	Output is correct
30	Correct	1 ms	2384 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	2 ms	2384 KB	Output is correct
33	Execution timed out	1034 ms	18364 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-