oj.uz

답안 #895762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895762 2023-12-30T18:49:13 Z heeheeheehaaw 거래 (IZhO13_trading) C++17
100 / 100
 349 ms 32784 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

int val[300005];
vector<int> v[300005];
bool visited[300005];

signed main()
{
    int n, m;
    cin>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        int st, dr, x;
        cin>>st>>dr>>x;
        val[i] = x;
        v[st].push_back(i);
        v[dr + 1].push_back(-i);
    }

    deque<pair<int, int>> dq;
    map<int, int> mp;
    set<pair<int, int>> s;
    for(int i = 1; i <= n; i++)
    {
        for(auto it : v[i])
        {
            if(it > 0)
            {
                int nr = val[it] - i + 1;
                s.insert(make_pair(nr, it));
                val[it] = nr;
            }
            else s.erase(s.find(make_pair(val[-it], -it)));
        }

        if(s.empty()) cout<<0<<" ";
        else cout<<(int)(s.rbegin()->first) + i - 1<<" ";
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8692 KB Output is correct
2 Correct 2 ms 8692 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8664 KB Output is correct
6 Correct 4 ms 8796 KB Output is correct
7 Correct 169 ms 20864 KB Output is correct
8 Correct 182 ms 21564 KB Output is correct
9 Correct 191 ms 22820 KB Output is correct
10 Correct 224 ms 24804 KB Output is correct
11 Correct 212 ms 23908 KB Output is correct
12 Correct 268 ms 27968 KB Output is correct
13 Correct 258 ms 24956 KB Output is correct
14 Correct 248 ms 26304 KB Output is correct
15 Correct 284 ms 28744 KB Output is correct
16 Correct 301 ms 27452 KB Output is correct
17 Correct 285 ms 28224 KB Output is correct
18 Correct 319 ms 32784 KB Output is correct
19 Correct 292 ms 28604 KB Output is correct
20 Correct 349 ms 31560 KB Output is correct