oj.uz

Submission #496662

# Submission time Handle Problem Language Result Execution time Memory
496662 2021-12-21T18:50:30 Z reo111 Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 5824 KB 
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//Ofast, avx, avx2, fma
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

#include <bits/stdc++.h>

/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/

#define F first
#define S second
#define pb push_back

#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define bpc(a) __builtin_popcount(a)
#define bpcll(a) __builtin_popcountll(a)
#define wtc(a) cerr << (#a) << " = " << a << '\n'
#define setprec(a) cout.precision(a)
#define base ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(a) freopen(a".in", "r", stdin); freopen(a".out", "w", stdout);

#define GET4_(a, b, c, d, ...) d
#define FOR_(i, a, b) for (int i = a; i < b; ++i)
#define FOR1(a) FOR_(i, 0, a)
#define FOR2(i, a) FOR_(i, 0, a)
#define FOR3(i, a, b) FOR_(i, a, b)
#define FORC_(...) GET4_(__VA_ARGS__, FOR3, FOR2, FOR1)
#define FOR(...) FORC_(__VA_ARGS__)(__VA_ARGS__)
#define TRV(i, a) for(auto &i : a)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template <class T> using VC = vector<T>;
/*template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//insert(), find_by_order(), order_of_key(), find(), erase(find())*/
template <class T, class V> using PR = pair<T, V>;

template <class T> bool mns(T &a, T b) {return (a > b ? a = b, 1 : 0);}
template <class T> bool mxs(T &a, T b) {return (a < b ? a = b, 1 : 0);}

pii DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int INF = 1e9 + 1e7 + 7;
const int MOD = 998244353;//1e9 + 7;
const ll INFLL = 1e18 + 1e16 + 7ll;
const int N = 1e5 + 5;
const int SS = 5e5 + 5; //rank


void Main();
void precalc();

int main() {
    //base//d
    //precalc();
    //setprec(10);
    int T = 1;
    //cin >> T;
    FOR(i, 1, T + 1) {
        //cout << "Case #" << i << ": ";
        Main();
    }
    return 0;
}

int n;
PR<int, pii> a[N];
ll pe[N], pg[N];

ll get(int l, int r) {
    if (!l) return pe[r];
    return pe[r] - pe[l - 1];
}

ll get1(int l, int r) {
    if (!l) return pg[r];
    return pg[r] - pg[l - 1];
}

void Main() {
    cin >> n;
    FOR(n) {
        cin >> a[i].F >> a[i].S.F >> a[i].S.S;
        if (!i) pe[i] = a[i].S.S, pg[i] = a[i].S.F;
        else pe[i] = pe[i - 1] + a[i].S.S, pg[i] = pg[i - 1] + a[i].S.F;
    }
    sort(a + 0, a + n);
    int fs = 0;
    ll cg = a[0].S.F, ce = a[0].S.S;
    ll ans = 0;
    FOR(i, 0, n) {
        FOR(j, i + 1) {
            if (get(j, i) >= a[i].F - a[j].F) {mxs(ans, get1(j, i)); break;}
        }
    }
    cout << ans;
}

Compilation message

divide.cpp: In function 'void Main()':
divide.cpp:101:9: warning: unused variable 'fs' [-Wunused-variable]
  101 |     int fs = 0;
      |         ^~
divide.cpp:102:8: warning: unused variable 'cg' [-Wunused-variable]
  102 |     ll cg = a[0].S.F, ce = a[0].S.S;
      |        ^~
divide.cpp:102:23: warning: unused variable 'ce' [-Wunused-variable]
  102 |     ll cg = a[0].S.F, ce = a[0].S.S;
      |                       ^~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 17 ms 332 KB Output is correct
24 Correct 17 ms 332 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 17 ms 332 KB Output is correct
24 Correct 17 ms 332 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 7 ms 520 KB Output is correct
27 Correct 8 ms 460 KB Output is correct
28 Correct 43 ms 1640 KB Output is correct
29 Correct 50 ms 2960 KB Output is correct
30 Correct 111 ms 5824 KB Output is correct
31 Correct 79 ms 4692 KB Output is correct
32 Correct 78 ms 4784 KB Output is correct
33 Correct 75 ms 4568 KB Output is correct
34 Execution timed out 1077 ms 4516 KB Time limit exceeded
35 Halted 0 ms 0 KB -