oj.uz

Submission #874979

# Submission time Handle Problem Language Result Execution time Memory
874979 2023-11-18T11:46:09 Z _fractal Unija (COCI17_unija) C++14
100 / 100
 217 ms 54356 KB 
#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second 
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) (int)x.size()
#define len(x) (int)strlen(x)
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub upper_bound
#define lb lower_bound 
#define make_unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())

mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef set<int> si;
typedef set<ll> sll;
typedef set<pii> spii;
typedef set<pll> spll;
typedef multiset <int> msi;
typedef multiset <ll> msll;
typedef map <int, int> mi;
typedef map <ll, ll> mll;

const int N = 1e6 + 2;
const int M = 1e5;
const int inf = 2e9 + 3;
const ll INF = 1e18;
const ld pi2 = 2.0 * 3.141592653589793;
const ld pi = 3.141592653589793;
const ld eps = 1e-12;

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};

int n;
int h[10 * N + 200];
ll ans;

int main() {
    speed;
    cin >> n;
    for (int i = 1, x, y; i <= n; ++i) {
        cin >> x >> y;
        h[x / 2] = max(h[x / 2], y / 2);
    }
    for (int i = 10 * N; i >= 1; --i) {
        h[i] = max(h[i + 1], h[i]);
        ans += 4 * h[i];
    }
    cout << ans << '\n';
    
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 39504 KB Output is correct
2 Correct 44 ms 39500 KB Output is correct
3 Correct 45 ms 39508 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 39504 KB Output is correct
2 Correct 46 ms 39476 KB Output is correct
3 Correct 45 ms 39504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 39508 KB Output is correct
2 Correct 46 ms 39500 KB Output is correct
3 Correct 46 ms 39340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 39372 KB Output is correct
2 Correct 46 ms 39548 KB Output is correct
3 Correct 45 ms 39548 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 39504 KB Output is correct
2 Correct 190 ms 54348 KB Output is correct
3 Correct 217 ms 54352 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 39504 KB Output is correct
2 Correct 45 ms 39324 KB Output is correct
3 Correct 45 ms 39400 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 39512 KB Output is correct
2 Correct 48 ms 39688 KB Output is correct
3 Correct 49 ms 39764 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 39512 KB Output is correct
2 Correct 63 ms 40744 KB Output is correct
3 Correct 57 ms 40772 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 39508 KB Output is correct
2 Correct 88 ms 43612 KB Output is correct
3 Correct 82 ms 43524 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 39504 KB Output is correct
2 Correct 188 ms 54340 KB Output is correct
3 Correct 179 ms 54356 KB Output is correct