oj.uz

Submission #819124

# Submission time Handle Problem Language Result Execution time Memory
819124 2023-08-10T08:07:29 Z cig32 Akcija (COCI21_akcija) C++17
0 / 110
 201 ms 524288 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long 
#define double long double
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}
void solve(int tc) {
  int n, k;
  cin >> n >> k;
  pair<int, int> p[n+1];
  for(int i=1; i<=n; i++) cin >> p[i].first >> p[i].second;
  sort(p+1, p+1+n, cmp);
  int m = ceil(k*k*1.0/n/n) * 20;
  int dp[n+1][n+1][m+1];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=m; j++) {
      dp[0][i][j] = 1e18;
    }
  }
  dp[0][0][1] = 0;
  for(int i=2; i<=m; i++) dp[0][0][i] = 1e18;
  for(int i=1; i<=n; i++) {
    for(int j=0; j<i; j++) {
      for(int l=1; l<=m; l++) {
        dp[i][j][l] = 1e18;
      }
    }
    int opt[m+1];
    for(int j=1; j<=m; j++) opt[j] = 1e18;
    for(int j=0; j<i; j++) {
      int res[m+1];
      int p1 = 1, p2 = 1;
      for(int l=1; l<=m; l++) {
        if(dp[i-1][j][p1] < opt[p2]) {
          res[l] = dp[i-1][j][p1++];
        }
        else {
          res[l] = opt[p2++];
        }
      }
      for(int l=1; l<=m; l++) {
        opt[l] = res[l];
      }
    }
    for(int j=i; j<=n; j++) {
      if(p[j].second >= i) {
        for(int l=1; l<=m; l++) dp[i][j][l] = opt[l] + p[j].first;
      }
      else {
        for(int l=1; l<=m; l++) dp[i][j][l] = 1e18;
      }
      int res[m+1];
      int p1 = 1, p2 = 1;
      for(int l=1; l<=m; l++) {
        if(dp[i-1][j][p1] < opt[p2]) {
          res[l] = dp[i-1][j][p1++];
        }
        else {
          res[l] = opt[p2++];
        }
      }
      for(int l=1; l<=m; l++) {
        opt[l] = res[l];
      }
    }
  }
  vector<pair<int, int> > sol;
  for(int i=n; i>=0; i--) {
    vector<int> v;
    for(int j=i; j<=n; j++) {
      for(int l=1; l<=m; l++) {
        if(dp[i][j][l] <= 1e13) v.push_back(dp[i][j][l]);
      }
    }
    sort(v.begin(), v.end());
    for(int x: v) {
      sol.push_back({i, x});
    }
  }
  for(int i=0; i<k; i++) {
    cout << sol[i].first << ' ' << sol[i].second << '\n';
  }
  
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 190 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 190 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 201 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 173 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 190 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -