oj.uz

답안 #595438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595438 2022-07-13T18:24:57 Z AdamGS Coins (LMIO19_monetos) C++17
59.9367 / 100
 28 ms 35132 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, INF=1e9+7;
int T[LIM][LIM], pref[LIM], suf[LIM];
pair<int,int>dp[LIM][LIM], dp2[57][57][57*30];
int n;
void rozwdp() {
  rep(i, n+1) dp[0][i].nd=n;
  rep(i, n) {
    rep(j, n) pref[j+1]=T[i][j]+pref[j];
    for(int j=n-1; j>=0; --j) suf[j]=1-T[i][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';
  }
}
void diag() {
  rep(i, n) {
    rep(j, n) cout << (j>=n-i || j<n/2 && j==n-i-1 && i+j==n-1) << " ";
    cout << '\n';
  }
}
void malen() {
  rep(i, n+1) rep(j, n*n/2) dp2[0][i][j+1]={INF, n};
  rep(i, n) {
    rep(j, n) pref[j+1]=T[i][j]+pref[j];
    rep(j, n+1) rep(l, n*n/2+1) dp2[i+1][j][l]={INF, n};
    rep(j, n+1) rep(l, n*n/2+1-j) dp2[i+1][j][l+j]={dp2[i][j][l].st+pref[j], j};
    for(int j=n-1; j>=0; --j) rep(l, n*n/2+1) dp2[i+1][j][l]=min(dp2[i+1][j][l], dp2[i+1][j+1][l]);
  }
  int aktp=0, akts=n*n/2;
  vector<int>V;
  for(int i=n; i; --i) {
    aktp=dp2[i][aktp][akts].nd;
    akts-=aktp;
    V.pb(aktp);
  }
  reverse(all(V));
  rep(i, n) {
    rep(j, n) cout << (j>=V[i]) << " ";
    cout << '\n';
  }
}
void pion() {
  rep(i, n) {
    rep(j, n) cout << (j>=n/2) << " ";
    cout << '\n';
  }
}
void poziomo() {
  rep(i, n) {
    rep(j, n) cout << (i>=n/2) << " ";
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t, k1, k2;
  cin >> t >> n >> k1 >> k2;
  rep(i, n) rep(j, n) cin >> T[i][j];
  if(t==5 || t==9 || t==10) rozwdp();
  else if(t==1 || t==2) malen();
  else if(t==8) pion();
  else if(t==4) poziomo();
  else diag();
}

Compilation message

monetos.cpp: In function 'void diag()':
monetos.cpp:35:52: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   35 |     rep(j, n) cout << (j>=n-i || j<n/2 && j==n-i-1 && i+j==n-1) << " ";
      |                                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~

Subtask #1
59.9366864481 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB K = 17
2 Correct 28 ms 35132 KB K = 576
3 Partially correct 10 ms 852 KB K = 20155
4 Partially correct 12 ms 852 KB K = 23205
5 Correct 12 ms 1492 KB K = 17065
6 Partially correct 17 ms 800 KB K = 22065
7 Partially correct 10 ms 852 KB K = 22427
8 Partially correct 10 ms 852 KB K = 20045
9 Correct 12 ms 1548 KB K = 19939
10 Correct 12 ms 1560 KB K = 18959