提出 #70488208

---

ソースコード 拡げる

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int INF = 1001001001;

int N, M;
vector<int> B;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    M = N*(N-1)/2;
    B.resize(M);
    for (int i = 0; i < M; ++i) scanf("%d", &B[i]);
    
    vector<int> BSum(M + 1, 0);
    for (int i = 0; i < M; ++i) BSum[i + 1] = BSum[i] + B[i];
    
    vector<int> ones;
    for (int i = 0; i < M; ++i) if (B[i]) ones.push_back(i);
    
    vector<int> mxs(M + 1, 0);
    for (int n = 1; n <= N; ++n) {
      const int k = n*(n-1)/2;
      chmax(mxs[M - k], k);
    }
    for (int z = M; z >= 1; --z) chmax(mxs[z - 1], mxs[z]);
    
    vector<int> fs{0};
    fs[0] = 0;
    for (int i = 0; i < M; ++i) {
      for (int k = 0; k <= i; ++k) {
        const int z = (M - BSum[M]) - (i - k);
        if (!(0 <= z && z <= M) || k > mxs[z]) {
          fs[k] = INF;
        }
      }
      vector<int> gs(i + 1 + 1, INF);
      for (int k = 0; k <= i; ++k) {
        // 0
        chmin(gs[k], fs[k]);
        // 1
        if (k < BSum[M]) {
          chmin(gs[k + 1], fs[k] + abs(i - ones[k]));
        }
      }
      fs.swap(gs);
    }
    int ans = fs[BSum[M]];
    printf("%d\n", (ans < INF) ? ans : -1);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:46:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   46 |     scanf("%d", &N);
      |     ~~~~~^~~~~~~~~~
Main.cpp:49:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   49 |     for (int i = 0; i < M; ++i) scanf("%d", &B[i]);
      |                                 ~~~~~^~~~~~~~~~~~~

ジャッジ結果