Submission #595375

#	Time	Username	Problem	Language	Result	Execution time	Memory
595375		AdamGS	Coins (LMIO19_monetos)	C++17	8.38 / 100	22 ms	1236 KiB

monetos

#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));
  int sum=0;
  rep(i, n) rep(j, n) if(j>=V[i]) ++sum;
  if(sum!=n*n/2) rep(i, n) V[i]=n/2;
  rep(i, n) {
    rep(j, n) cout << (j>=V[i]) << " ";
    cout << '\n';
  }
}

• Subtask 1: 8.375118238990002 / 100