結果
問題 | No.704 ゴミ拾い Medium |
ユーザー |
![]() |
提出日時 | 2019-03-16 19:31:43 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 136 ms / 1,500 ms |
コード長 | 1,684 bytes |
コンパイル時間 | 616 ms |
コンパイル使用メモリ | 80,700 KB |
実行使用メモリ | 17,720 KB |
最終ジャッジ日時 | 2024-07-01 22:38:44 |
合計ジャッジ時間 | 5,774 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 44 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:61:47: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll*’ {aka ‘long long int*’} [-Wformat=] 61 | for (int i = 1; i <= n; i++)scanf_s("%d", a + i); | ~^ ~~~~~ | | | | int* ll* {aka long long int*} | %lld main.cpp:62:47: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll*’ {aka ‘long long int*’} [-Wformat=] 62 | for (int i = 1; i <= n; i++)scanf_s("%d", x + i); | ~^ ~~~~~ | | | | int* ll* {aka long long int*} | %lld main.cpp:63:47: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll*’ {aka ‘long long int*’} [-Wformat=] 63 | for (int i = 1; i <= n; i++)scanf_s("%d", y + i); | ~^ ~~~~~ | | | | int* ll* {aka long long int*} | %lld main.cpp:61:44: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 61 | for (int i = 1; i <= n; i++)scanf_s("%d", a + i); | ^ main.cpp:62:44: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 62 | for (int i = 1; i <= n; i++)scanf_s("%d", x + i); |
ソースコード
#include <iostream> #include <algorithm> #include <cstring> #include <sstream> #include <map> #include <queue> #include <set> #include <vector> #include <stack> #include <cstdio> #include <cmath> #include <bitset> #define mk make_pair #define pb push_back using namespace std; typedef long long int ll; typedef pair<ll, ll> pos; const ll MOD = 1234567, N = 300010, dx[4] = { -1,1,0,0 }, dy[4] = { 0,0,-1,1 }, MIN = -72340172838, MAX = 72340172838; const int S = 60; ll mn(ll a, ll b) { if (a == -1)return b; if (b == -1)return a; return min(a, b); } static ll gcd(ll v1, ll v2) { if (v1 == 0)return v2; if (v2 == 0)return v1; if (v2 > v1)return gcd(v2%v1, v1); return gcd(v1%v2, v2); } ll pw(ll v1, ll v2) { ll v3 = 1; while (v2 > 0) { if (v2 % 2)v3 = (v3*v1) % MOD; v1 = (v1*v1) % MOD; v2 /= 2; } return v3; } ll n, a[N], dp[N],bt1[N],bt2[N],x[N],y[N]; void ad(ll v1, ll v2,ll bt[]) { while (v1 < N) { bt[v1] = min(bt[v1],v2); v1 += v1 & -v1; } } ll sm(ll v1,ll bt[]) { ll v2 = MAX; while (v1 > 0) { v2 =min(bt[v1],v2); v1 -= v1 & -v1; } return v2; } #define scanf_s scanf int main() { cin >> n; for (int i = 1; i <= n; i++)scanf_s("%d", a + i); for (int i = 1; i <= n; i++)scanf_s("%d", x + i); for (int i = 1; i <= n; i++)scanf_s("%d", y + i); for (int i = 1; i < N; i++)bt1[i] = bt2[i] = MAX; for (int i = 1; i <= n; i++) { ll xi = upper_bound(x + 1, x + i + 1, a[i]) - x - 1; ad(i, dp[i - 1] - x[i] + y[i], bt1); ad(n + 1 - i, dp[i - 1] + x[i] + y[i], bt2); dp[i] = MAX; ll v1 = sm(xi, bt1), v2 = sm(n + 1 - (xi + 1), bt2); dp[i] = mn(dp[i], a[i] + v1); dp[i] = mn(dp[i], v2 - a[i]); } cout << dp[n] << endl; return 0; }