oj.uz

답안 #699651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699651 2023-02-17T16:17:23 Z Sam_a17 조교 (CEOI16_popeala) C++17
100 / 100
 315 ms 37276 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
  
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
  
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
  
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
  
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
  
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
  
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
  
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
  
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
  
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e4 + 10, M = 60, inf = 2e9;
long long n, t, s, p[N], left_bad[M][N];
vector<long long> row_bad[N];
long long dp[M][N];
char a[M][N];


long long pmin[M][N];

void solve_() {
  cin >> n >> t >> s;

  for(int i = 1; i <= t; i++) {
    cin >> p[i];

    p[i] = p[i - 1] + p[i];
  }

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= t; j++) {
      cin >> a[i][j];
    }
  }

  for(int i = 0; i <= s; i++) {
    for(int j = 0; j <= t; j++) {
      dp[i][j] = inf;
    }
  }

  for(int i = 1; i <= n; i++) {
    left_bad[i][0] = 0;
    for(int j = 1; j <= t; j++) {
      if(a[i][j] == '0') {
        left_bad[i][j] = j;
      } else {
        left_bad[i][j] = left_bad[i][j - 1];
      }
      row_bad[j].push_back(left_bad[i][j]);
    }
  }

  for(int i = 1; i <= t; i++) {
    row_bad[i].push_back(i);
    sort(all(row_bad[i]));
    reverse(all(row_bad[i]));
  }

  dp[1][0] = 0;
  for(int i = 1; i <= t; i++) {
    int cnt = 0;
    for(int j = 0; j < sz(row_bad[i]); j++) {
      if(row_bad[i][j] == 0) {
        cnt++;
      }
    }
    dp[1][i] = cnt * p[i]; 
  }

  for(int i = 2; i <= s; i++) {

    for(int k = 0; k <= n; k++) {
      pmin[k][0] = inf;
      for(int j = 1; j <= t; j++) {
        pmin[k][j] = min(pmin[k][j - 1], dp[i - 1][j] - p[j] * k);
      }
    }

    for(int j = i; j <= t; j++) {
      
      for(int k = 1; k < sz(row_bad[j]); k++) {
        int l = row_bad[j][k], r = row_bad[j][k - 1];
        int cnt = sz(row_bad[j]) - k;
        if(l < r) {
          dp[i][j] = min(dp[i][j], pmin[cnt][r - 1] + p[j] * cnt);
        }
      }

      if(row_bad[j].back() != 0) {
        dp[i][j] = min(dp[i][j], pmin[0][row_bad[j].back() - 1]);
      }
    }
  }

  //
  for(int i = 1; i <= s; i++) {
    cout << dp[i][t] << '\n';
  }
}

int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
  
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
  
  return 0;
}

Compilation message

popeala.cpp: In function 'void setIO(std::string)':
popeala.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
popeala.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2564 KB Output is correct
2 Correct 7 ms 2528 KB Output is correct
3 Correct 7 ms 2572 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 5444 KB Output is correct
2 Correct 46 ms 6868 KB Output is correct
3 Correct 56 ms 8660 KB Output is correct

Subtask #4
74.0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 8 ms 2564 KB Output is correct
4 Correct 7 ms 2528 KB Output is correct
5 Correct 7 ms 2572 KB Output is correct
6 Correct 32 ms 5444 KB Output is correct
7 Correct 46 ms 6868 KB Output is correct
8 Correct 56 ms 8660 KB Output is correct
9 Correct 107 ms 13144 KB Output is correct
10 Correct 123 ms 16676 KB Output is correct
11 Correct 295 ms 36548 KB Output is correct
12 Correct 289 ms 37276 KB Output is correct
13 Correct 310 ms 37196 KB Output is correct
14 Correct 315 ms 37248 KB Output is correct
15 Correct 309 ms 37196 KB Output is correct