結果

問題 No.2542 Yokan for Two
ユーザー rikein12rikein12
提出日時 2023-11-24 23:47:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 4,879 bytes
コンパイル時間 2,379 ms
コンパイル使用メモリ 205,528 KB
実行使用メモリ 23,424 KB
最終ジャッジ日時 2024-09-26 09:50:14
合計ジャッジ時間 4,591 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 14 ms
9,600 KB
testcase_04 AC 9 ms
7,552 KB
testcase_05 AC 18 ms
13,312 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 32 ms
21,120 KB
testcase_08 AC 10 ms
8,448 KB
testcase_09 AC 32 ms
20,608 KB
testcase_10 AC 6 ms
5,632 KB
testcase_11 AC 7 ms
6,272 KB
testcase_12 AC 14 ms
11,008 KB
testcase_13 AC 6 ms
5,376 KB
testcase_14 AC 34 ms
22,272 KB
testcase_15 AC 35 ms
23,168 KB
testcase_16 AC 34 ms
22,912 KB
testcase_17 AC 37 ms
22,272 KB
testcase_18 AC 40 ms
23,296 KB
testcase_19 AC 23 ms
14,464 KB
testcase_20 AC 21 ms
13,568 KB
testcase_21 AC 22 ms
13,696 KB
testcase_22 AC 24 ms
14,080 KB
testcase_23 AC 22 ms
13,952 KB
testcase_24 AC 4 ms
5,376 KB
testcase_25 AC 6 ms
5,760 KB
testcase_26 AC 6 ms
5,760 KB
testcase_27 AC 6 ms
6,016 KB
testcase_28 AC 7 ms
6,144 KB
testcase_29 AC 12 ms
8,576 KB
testcase_30 AC 39 ms
23,296 KB
testcase_31 AC 38 ms
23,256 KB
testcase_32 AC 40 ms
23,168 KB
testcase_33 AC 39 ms
23,264 KB
testcase_34 AC 39 ms
23,296 KB
testcase_35 AC 39 ms
23,152 KB
testcase_36 AC 39 ms
23,048 KB
testcase_37 AC 39 ms
23,296 KB
testcase_38 AC 39 ms
23,296 KB
testcase_39 AC 39 ms
23,168 KB
testcase_40 AC 38 ms
23,040 KB
testcase_41 AC 39 ms
23,424 KB
testcase_42 AC 39 ms
23,296 KB
testcase_43 AC 39 ms
23,156 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "lib/base/base.hpp"

#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(n);++(i))
#define rep3(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define endl '\n'
#define all(v) (v).begin(),(v).end()

using ll = long long;

using vi = vector<int>;
using vvi = vector<vi>;

using vll = vector<ll>;
using vvll = vector<vll>;

template <class T>
using uset = unordered_set<T>;
template <class S, class T>
using umap = unordered_map<S, T>;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

template <class T>
using gprique = priority_queue<T, vector<T>, greater<T>>;
template <class T>
using lprique = priority_queue<T, vector<T>, less<T>>;

const int mod998 = 998244353;
const int mod107 = 1000000007;
#line 2 "lib/utility/io.hpp"

#define INT(...) \
  int __VA_ARGS__; \
  IN(__VA_ARGS__)
#define LL(...) \
  ll __VA_ARGS__; \
  IN(__VA_ARGS__)
#define STR(...) \
  string __VA_ARGS__; \
  IN(__VA_ARGS__)
#define CHR(...) \
  char __VA_ARGS__; \
  IN(__VA_ARGS__)
#define DBL(...) \
  long double __VA_ARGS__; \
  IN(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void read(int &a) { cin >> a; }
void read(long long &a) { cin >> a; }
void read(char &a) { cin >> a; }
void read(double &a) { cin >> a; }
void read(long double &a) { cin >> a; }
void read(string &a) { cin >> a; }
template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }
template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}
template <class T> void read(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
  read(head);
  IN(tail...);
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& A) {
  os << A.first << " " << A.second;
  return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& A) {
  for (size_t i = 0; i < A.size(); i++) {
    if(i) os << " ";
    os << A[i];
  }
  return os;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& A) {
  int count = 0;
  os << "{";
  for(auto [t, u] : A){
    if(count) os << ", ";
    os << t << ": " << u;
    count++;
  }
  os << "}";
  return os;
}

template <typename T>
ostream& operator<<(ostream& os, const set<T>& A) {
  for(auto it = A.begin(); it != A.end(); ++it){
    if (it != A.begin()) os << " ";
    os << (*it);
  }
  return os;
}

template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& A) {
  size_t count = 0;
  T prev;
  os << "{";
  bool is_null = true, is_first = true;
  for(auto it = A.begin(); it != A.end(); ++it){
    if(it == A.begin()) {
      is_null = false;
      prev = (*it);
      count = 1;
    }
    if (prev != (*it)){
      if(!is_first) os << ", ";
      is_first = false;
      os << prev << ": " << count;
      prev = (*it);
      count = 1;
    } else {
      ++count;
    }
  }
  if(!is_null){
    if(!is_first) os << ", ";
    is_first = false;
    os << prev << ": " << count;
  }
  os << "}";
  return os;
}


void print() {
  cout << "\n";
  cout.flush();
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail)) cout << " ";
  print(forward<Tail>(tail)...);
}

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 3 "main.cpp"

bool DP[105][200200];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int l,n;
    IN(l,n);
    vi x(n);
    IN(x);
    int base = 100100;
    rep(j,n+2) rep3(i, base-l, base+l+1) DP[j][i] = false;
    DP[0][base] = true;
    rep(i,n+1){
        // rep3(j,base-l,base+l+1){
        //     if (DP[i][j]) print(j-base,i);
        // }            
        if (i==0){
            rep3(j,base-l,base+l+1){
                if (j - x[0]>=base-l) DP[i+1][j] = DP[i][j-x[0]];
            }            
        } else if (i==n){
            rep3(j,base-l,base+l+1){
                if (j + l - x[n-1]<=base+l) DP[i+1][j] = DP[i][j+l-x[n-1]];
            }            
        } else {
            rep3(j,base-l,base+l+1){
                if (j + x[i]-x[i-1]<=base+l) DP[i+1][j] |= DP[i][j+x[i]-x[i-1]];
                if (j - x[i]+x[i-1]>=base-l) DP[i+1][j] |= DP[i][j-x[i]+x[i-1]];
            }            
        }
    }
    int ans = l;
    // rep3(j,base-l,base+l+1){
    //     if (DP[n+1][j]) print(j-base, n);
    // }            
    rep3(i,base-l,base+l+1){
        if(DP[n+1][i]) {
            //print(i-base);
            ans = min(abs(base-i), ans);
        }
    }
    print(ans);
}
0