oj.uz

Submission #910999

# Submission time Handle Problem Language Result Execution time Memory
910999 2024-01-18T10:57:21 Z bachhoangxuan None (JOI14_ho_t2) C++17
100 / 100
 17 ms 644 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=10005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int m,n,p[maxn],d[maxn];

void solve(){
    cin >> m >> n;
    for(int i=1;i<=m;i++) cin >> p[i];
    sort(p+1,p+m+1,greater<int>());
    for(int i=1;i<=m;i++) p[i]+=p[i-1],d[i]=inf;
    for(int i=1;i<=n;i++){
        int c,e;cin >> c >> e;
        for(int j=m;j>=0;j--) d[min(j+c,m)]=min(d[min(j+c,m)],d[j]+e);
    }
    int res=0;
    for(int i=1;i<=m;i++) res=max(res,p[i]-d[i]);
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 7 ms 604 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 6 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 6 ms 604 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 7 ms 604 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 7 ms 604 KB Output is correct
14 Correct 6 ms 604 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 5 ms 604 KB Output is correct
18 Correct 6 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 6 ms 604 KB Output is correct
21 Correct 17 ms 604 KB Output is correct
22 Correct 11 ms 604 KB Output is correct
23 Correct 11 ms 604 KB Output is correct
24 Correct 12 ms 604 KB Output is correct
25 Correct 11 ms 604 KB Output is correct
26 Correct 12 ms 644 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 8 ms 604 KB Output is correct
29 Correct 7 ms 604 KB Output is correct
30 Correct 6 ms 604 KB Output is correct