結果
問題 | No.2542 Yokan for Two |
ユーザー | milanis48663220 |
提出日時 | 2023-11-24 21:38:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 2,438 bytes |
コンパイル時間 | 1,144 ms |
コンパイル使用メモリ | 119,744 KB |
実行使用メモリ | 42,472 KB |
最終ジャッジ日時 | 2023-11-24 21:38:46 |
合計ジャッジ時間 | 3,477 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 14 ms
15,836 KB |
testcase_04 | AC | 14 ms
36,324 KB |
testcase_05 | AC | 24 ms
26,080 KB |
testcase_06 | AC | 3 ms
6,676 KB |
testcase_07 | AC | 42 ms
40,420 KB |
testcase_08 | AC | 14 ms
15,836 KB |
testcase_09 | AC | 41 ms
40,420 KB |
testcase_10 | AC | 9 ms
21,980 KB |
testcase_11 | AC | 12 ms
28,132 KB |
testcase_12 | AC | 21 ms
21,980 KB |
testcase_13 | AC | 9 ms
21,980 KB |
testcase_14 | AC | 41 ms
42,472 KB |
testcase_15 | AC | 42 ms
42,472 KB |
testcase_16 | AC | 40 ms
42,472 KB |
testcase_17 | AC | 39 ms
42,472 KB |
testcase_18 | AC | 42 ms
42,472 KB |
testcase_19 | AC | 27 ms
42,472 KB |
testcase_20 | AC | 25 ms
42,472 KB |
testcase_21 | AC | 25 ms
42,472 KB |
testcase_22 | AC | 25 ms
42,472 KB |
testcase_23 | AC | 25 ms
42,472 KB |
testcase_24 | AC | 5 ms
7,644 KB |
testcase_25 | AC | 5 ms
7,644 KB |
testcase_26 | AC | 5 ms
7,644 KB |
testcase_27 | AC | 6 ms
9,696 KB |
testcase_28 | AC | 7 ms
9,692 KB |
testcase_29 | AC | 13 ms
13,788 KB |
testcase_30 | AC | 42 ms
42,468 KB |
testcase_31 | AC | 41 ms
42,468 KB |
testcase_32 | AC | 41 ms
42,468 KB |
testcase_33 | AC | 41 ms
42,468 KB |
testcase_34 | AC | 41 ms
42,468 KB |
testcase_35 | AC | 41 ms
42,468 KB |
testcase_36 | AC | 41 ms
42,468 KB |
testcase_37 | AC | 42 ms
42,468 KB |
testcase_38 | AC | 41 ms
42,468 KB |
testcase_39 | AC | 41 ms
42,472 KB |
testcase_40 | AC | 42 ms
42,472 KB |
testcase_41 | AC | 41 ms
42,472 KB |
testcase_42 | AC | 42 ms
42,472 KB |
testcase_43 | AC | 40 ms
42,472 KB |
ソースコード
#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; }