oj.uz

Submission #246067

# Submission time Handle Problem Language Result Execution time Memory
246067 2020-07-08T06:42:39 Z Vimmer Unija (COCI17_unija) C++14
100 / 100
 372 ms 16744 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
    ////freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    vector <pair <int, int> > g(n);

    for (int i = 0; i < n; i++) cin >> g[i].F >> g[i].S;

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

    int mx = 0;

    vector <pair <int, int> > pr; pr.clear();

    for (int i = n - 1; i >= 0; i--)
    {
        if (g[i].S > mx) pr.pb(g[i]);

        mx = max(mx, g[i].S);
    }

    g = pr;

    ll lst = 0;

    ll ans = 0;

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

    for (int i = 0; i < sz(pr); i++)
    {
        ans += (ll(pr[i].F) - lst) * ll(pr[i].S);

        lst = pr[i].F;
    }

    cout << ans << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 16616 KB Output is correct
2 Correct 372 ms 16744 KB Output is correct
3 Correct 362 ms 16644 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 768 KB Output is correct
2 Correct 14 ms 968 KB Output is correct
3 Correct 13 ms 896 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1408 KB Output is correct
2 Correct 35 ms 1536 KB Output is correct
3 Correct 36 ms 1536 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 2952 KB Output is correct
2 Correct 97 ms 3072 KB Output is correct
3 Correct 111 ms 3136 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 8320 KB Output is correct
2 Correct 352 ms 8448 KB Output is correct
3 Correct 351 ms 8448 KB Output is correct