結果
問題 | No.2542 Yokan for Two |
ユーザー |
![]() |
提出日時 | 2023-11-24 21:38:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 66 ms / 2,000 ms |
コード長 | 2,438 bytes |
コンパイル時間 | 1,145 ms |
コンパイル使用メモリ | 115,848 KB |
最終ジャッジ日時 | 2025-02-17 23:52:54 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const int X = 100000; bool ok[105][2][200005]; void set_ok(int i, int j, int k, bool f){ ok[i][j][k+X] = f; } bool get_ok(int i, int j, int k){ return ok[i][j][k+X]; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int l, n; cin >> l >> n; vector<int> x(n+2); for(int i = 1; i <= n; i++) cin >> x[i]; x[n+1] = l; set_ok(0, 0, 0, true); for(int i = 1; i <= n+1; i++){ int len = x[i]-x[i-1]; for(int j = 0; j < 2; j++){ for(int diff = -l; diff <= l; diff++){ if(!get_ok(i-1, j, diff)) continue; int diff_next = [&](){ if(j == 0) return diff+len; return diff-len; }(); if(i != 1){ set_ok(i, j, diff_next, true); } diff_next = [&](){ if(j == 0) return diff-len; return diff+len; }(); set_ok(i, j^1, diff_next, true); } } } int ans = l; for(int diff = -l; diff <= l; diff++){ if(get_ok(n+1, 0, diff)) { chmin(ans, abs(diff)); } } cout << ans << endl; }