oj.uz

Submission #734827

# Submission time Handle Problem Language Result Execution time Memory
734827 2023-05-03T06:47:42 Z Huseyn123 Akcija (COCI21_akcija) C++17
40 / 110
 189 ms 23092 KB 
#include <bits/stdc++.h>
#define MAX 200001
#define INF LLONG_MAX
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define gett(x,m) get<m>(x)
#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define sorta(a,sz) sort(a,a+sz)
#define inputar(a,b){\
    for(int i=0;i<b;i++){\
        cin >> a[i];\
    }\
}
#define inputvec(a,b){\
    for(int i=0;i<b;i++){\
        ll num;\
        cin >> num;\
        a.pb(num);\
    }\
}
#define outputar(a,b){\
    for(int i=0;i<b;i++){\
        cout << a[i] << " ";\
    }\
    cout << "\n";\
}
#define outputvec(a){\
    for(auto x:a){\
        cout << x << " ";\
    }\
    cout << "\n";\
}
#define reset(a,n,v){\
    for(int i=0;i<n;i++){\
        a[i]=v;\
    }\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
  freopen((filename+".in").c_str(),"r",stdin);
  freopen((filename+".out").c_str(),"w",stdout);
}
ll n,q,t=1,m,n2,m2,k,cnt=0,x,y,z,x2,y2,z2,res1=0,a[MAX],b[MAX];
ll c[1501][1501];
ll fact[MAX];
ll inv_fact[MAX];
string str[MAX];
string s1,s2;
const int mod = 998244353;
ll dx[4]={1,0,0,-1};
ll dy[4]={0,1,-1,0};
struct custom_hash {
   static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
void solve(){
    cin >> n >> k;
    vector<pll> c;
    for(int i=0;i<n;i++){
        cin >> x >> y;
        c.pb(mp(x,y));
    }
    sortv(c);
    if(n<=20){
        vector<pll> d;
        ll h=(1<<n);
        for(int i=0;i<h;i++){
            ll cnt=0;
            bool ok=true;
            for(int j=1;j<=n;j++){
                a[j]=0;
            }
            ll res=0;
            for(int j=0;j<n;j++){
                if((i&(1<<j))){
                    a[c[j].ss]++;
                    res+=c[j].ff;
                    cnt++;
                }
            }
            ll cnt2=0;
            for(int j=1;j<=n;j++){
                cnt2+=a[j];
                if(cnt2>j){
                    ok=false;
                }
            }
            if(ok){
                d.pb(mp(cnt2,INF-res));
            }
        }
        sortv(d);
        reverse(all(d));
        for(int i=0;i<k;i++){
            cout << d[i].ff << " " << INF-d[i].ss << "\n";
        }
        return;
    }
    ll res=0;
    ll cnt2=0;
    for(auto x:c){
        a[x.ss]++;
        ll cnt=0;
        bool ok=true;
        for(int i=1;i<=n;i++){
            cnt+=a[i];
            if(cnt>i){
                ok=false;
            }
        }
        if(ok){
            res+=x.ff;
            cnt2++;
        }
        else{
            a[x.ss]--;
        }
    }
    cout << cnt2 << " " << res << "\n";
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //USACO("poetry");
    //freopen("input.txt","r",stdin);
    //cin >> t;
    ll cnt1=1;
    while(t--){
        solve();
        cnt1++;
    }
}
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
ifstream fin("template.in");
ofstream fout("template.out");
*/
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
ifstream fin("template.in");
ofstream fout("template.out");
*/
/*
ll b[51][51];
b[0][0] = 1;
    for (int n = 1; n <= 50; ++n){
        b[n][0] = b[n][n] = 1;
        for (int k = 1; k < n; ++k)
            b[n][k] = b[n - 1][k - 1] + b[n - 1][k];
    }
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6560 KB Output is correct
2 Correct 7 ms 6564 KB Output is correct
3 Correct 6 ms 6612 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6612 KB Output is correct
6 Correct 8 ms 6612 KB Output is correct
7 Correct 6 ms 6612 KB Output is correct
8 Correct 6 ms 6612 KB Output is correct
9 Correct 6 ms 6664 KB Output is correct
10 Correct 7 ms 6612 KB Output is correct
11 Correct 4 ms 6520 KB Output is correct
12 Correct 3 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6560 KB Output is correct
2 Correct 7 ms 6564 KB Output is correct
3 Correct 6 ms 6612 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6612 KB Output is correct
6 Correct 8 ms 6612 KB Output is correct
7 Correct 6 ms 6612 KB Output is correct
8 Correct 6 ms 6612 KB Output is correct
9 Correct 6 ms 6664 KB Output is correct
10 Correct 7 ms 6612 KB Output is correct
11 Correct 4 ms 6520 KB Output is correct
12 Correct 3 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 7 ms 6676 KB Output is correct
15 Correct 7 ms 6612 KB Output is correct
16 Correct 6 ms 6612 KB Output is correct
17 Correct 7 ms 6680 KB Output is correct
18 Correct 7 ms 6612 KB Output is correct
19 Correct 6 ms 6612 KB Output is correct
20 Correct 7 ms 6664 KB Output is correct
21 Correct 6 ms 6612 KB Output is correct
22 Correct 6 ms 6612 KB Output is correct
23 Correct 7 ms 6672 KB Output is correct
24 Correct 3 ms 6484 KB Output is correct
25 Correct 3 ms 6484 KB Output is correct
26 Correct 3 ms 6484 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 6612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 14924 KB Output is correct
2 Correct 189 ms 23092 KB Output is correct
3 Correct 48 ms 10764 KB Output is correct
4 Correct 36 ms 8784 KB Output is correct
5 Correct 184 ms 23084 KB Output is correct
6 Correct 22 ms 6484 KB Output is correct
7 Correct 80 ms 7224 KB Output is correct
8 Correct 26 ms 6740 KB Output is correct
9 Correct 26 ms 6680 KB Output is correct
10 Correct 45 ms 6588 KB Output is correct
11 Correct 4 ms 6596 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 63 ms 10852 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6560 KB Output is correct
2 Correct 7 ms 6564 KB Output is correct
3 Correct 6 ms 6612 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6612 KB Output is correct
6 Correct 8 ms 6612 KB Output is correct
7 Correct 6 ms 6612 KB Output is correct
8 Correct 6 ms 6612 KB Output is correct
9 Correct 6 ms 6664 KB Output is correct
10 Correct 7 ms 6612 KB Output is correct
11 Correct 4 ms 6520 KB Output is correct
12 Correct 3 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 7 ms 6676 KB Output is correct
15 Correct 7 ms 6612 KB Output is correct
16 Correct 6 ms 6612 KB Output is correct
17 Correct 7 ms 6680 KB Output is correct
18 Correct 7 ms 6612 KB Output is correct
19 Correct 6 ms 6612 KB Output is correct
20 Correct 7 ms 6664 KB Output is correct
21 Correct 6 ms 6612 KB Output is correct
22 Correct 6 ms 6612 KB Output is correct
23 Correct 7 ms 6672 KB Output is correct
24 Correct 3 ms 6484 KB Output is correct
25 Correct 3 ms 6484 KB Output is correct
26 Correct 3 ms 6484 KB Output is correct
27 Incorrect 8 ms 6612 KB Output isn't correct
28 Halted 0 ms 0 KB -