oj.uz

Submission #595371

# Submission time Handle Problem Language Result Execution time Memory
595371 2022-07-13T16:52:29 Z AdamGS Coins (LMIO19_monetos) C++17
30 / 100
 20 ms 1404 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=307;
int T[LIM], pref[LIM], suf[LIM];
pair<int,int>dp[LIM][LIM];
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t, n, k1, k2;
  cin >> t >> n >> k1 >> k2;
  rep(i, n) dp[0][i].nd=n;
  rep(i, n) {
    rep(j, n) {
      cin >> T[j];
      pref[j+1]=T[j]+pref[j];
    }
    for(int j=n-1; j>=0; --j) suf[j]=1-T[j]+suf[j+1];
    rep(j, n+1) {
      dp[i+1][j]={dp[i][j].st+pref[j]+suf[j], j};
    }
    for(int j=n-1; j>=0; --j) dp[i+1][j]=min(dp[i+1][j], dp[i+1][j+1]);
  }
  vector<int>V;
  int akt=0;
  for(int i=n; i; --i) {
    akt=dp[i][akt].nd;
    V.pb(akt);
  }
  reverse(all(V));
  rep(i, n) {
    rep(j, n) cout << (j>=V[i]) << " ";
    cout << '\n';
  }
}

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 340 KB proof wrong, contact admin
2 Failed 1 ms 468 KB proof wrong, contact admin
3 Failed 13 ms 1352 KB proof wrong, contact admin
4 Failed 14 ms 1360 KB proof wrong, contact admin
5 Correct 12 ms 1404 KB K = 17065
6 Failed 20 ms 1364 KB proof wrong, contact admin
7 Failed 15 ms 1364 KB proof wrong, contact admin
8 Failed 13 ms 1364 KB proof wrong, contact admin
9 Correct 15 ms 1404 KB K = 19939
10 Correct 13 ms 1364 KB K = 18959