oj.uz

답안 #1115035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115035 2024-11-19T23:01:28 Z AdamGS Fire (JOI20_ho_t5) C++17
0 / 100
 1000 ms 22832 KB 
#include<bits/stdc++.h>

using namespace std;
int main() {
    int n, q, t, l, p, s;
    cin >> n >> q;
    vector<int> dis;
    vector<vector<int>> fakty;
    vector<vector<pair<int, int>>> zap(n);
    vector<int> dod;
    for (int i = 0; i < n; i++) {
        cin >> s;
        dis.push_back(s);
    }
    for (int i = 0; i < q; i++) {
        cin >> t >> l >> p;
        zap[t - 1].push_back({l, p});
        fakty.push_back({t, l, p});
    }
    map<vector<int>, int> wyniki;
    for (int i = 0; i < n; i++) {
        for (int j = n - 1; j > 0; j--) {
            if (dis[j - 1] > dis[j]) {
                dis[j] = dis[j - 1];
            }
        }
        for (pair<int, int> z : zap[i]) {
            long long s = 0;
            for(int y = z.first; y <= z.second; y++) {
                s += dis[y - 1];
            }
            wyniki[{i + 1, z.first, z.second}] = s;
            //cout << i + 1 << " " << z.first << " " << z.second << endl;
        }
    }
    for(vector<int> i : fakty) {
        //cout << i[0] << " " << i[1] << " " << i[2] << endl;
        cout << wyniki[i] << endl;
    }
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -