oj.uz

Submission #170822

# Submission time Handle Problem Language Result Execution time Memory
170822 2019-12-26T12:48:26 Z davitmarg Trading (IZhO13_trading) C++17
100 / 100
 563 ms 45936 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 300005;

int n, m;
vector<int> add[N], rem[N];
multiset<int> s;

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        add[i].PB(-i);
        rem[i].PB(-i);
    }
    while (m--)
    {
        int l, r, x;
        scanf("%d%d%d", &l, &r, &x);
        add[l].PB(x - l);
        rem[r].PB(x - l);
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < add[i].size(); j++)
            s.insert(add[i][j]);
        printf("%d ", i + (*s.rbegin()));
        for (int j = 0; j < rem[i].size(); j++)
            s.erase(s.find(rem[i][j]));
    }
    cout << endl;
    return 0;
}

/*

2 
2 0
3



*/

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:49:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < add[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~
trading.cpp:52:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < rem[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~
trading.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &l, &r, &x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 16 ms 14456 KB Output is correct
5 Correct 17 ms 14584 KB Output is correct
6 Correct 19 ms 14712 KB Output is correct
7 Correct 268 ms 30716 KB Output is correct
8 Correct 303 ms 32096 KB Output is correct
9 Correct 327 ms 33776 KB Output is correct
10 Correct 367 ms 36708 KB Output is correct
11 Correct 397 ms 35548 KB Output is correct
12 Correct 401 ms 39916 KB Output is correct
13 Correct 391 ms 37820 KB Output is correct
14 Correct 453 ms 40528 KB Output is correct
15 Correct 449 ms 41328 KB Output is correct
16 Correct 472 ms 40696 KB Output is correct
17 Correct 465 ms 42480 KB Output is correct
18 Correct 514 ms 45508 KB Output is correct
19 Correct 563 ms 43968 KB Output is correct
20 Correct 550 ms 45936 KB Output is correct