結果

問題 No.704 ゴミ拾い Medium
ユーザー azbrugbyazbrugby
提出日時 2019-03-16 18:58:22
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 1,667 bytes
コンパイル時間 609 ms
コンパイル使用メモリ 80,320 KB
実行使用メモリ 17,792 KB
最終ジャッジ日時 2024-07-01 22:38:05
合計ジャッジ時間 5,841 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:63:45: 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("%d", a + i);
      |                                            ~^   ~~~~~
      |                                             |     |
      |                                             int*  ll* {aka long long int*}
      |                                            %lld
main.cpp:64:45: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll*’ {aka ‘long long int*’} [-Wformat=]
   64 |         for (int i = 1; i <= n; i++)scanf("%d", x + i);
      |                                            ~^   ~~~~~
      |                                             |     |
      |                                             int*  ll* {aka long long int*}
      |                                            %lld
main.cpp:65:45: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll*’ {aka ‘long long int*’} [-Wformat=]
   65 |         for (int i = 1; i <= n; i++)scanf("%d", y + i);
      |                                            ~^   ~~~~~
      |                                             |     |
      |                                             int*  ll* {aka long long int*}
      |                                            %lld
main.cpp:63:42: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   63 |         for (int i = 1; i <= n; i++)scanf("%d", a + i);
      |                                     ~~~~~^~~~~~~~~~~~~
main.cpp:64:42: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   64 |         for (int i = 1; i <= n; i++)scanf("%d", x + i);
      |

ソースコード

diff # 

#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] = mn(bt[v1],v2);
		v1 += v1 & -v1;
	}
}

int sm(ll v1,ll bt[]) {
	ll v2 = MAX;
	while (v1 > 0) {
		v2 =mn(bt[v1],v2);
		v1 -= v1 & -v1;
	}
	return v2;
}


int main() {
	cin >> n;
	memset(bt1, -1, sizeof(bt1));
	memset(bt2, -1, sizeof(bt2));
	for (int i = 1; i <= n; i++)scanf("%d", a + i);
	for (int i = 1; i <= n; i++)scanf("%d", x + i);
	for (int i = 1; i <= n; i++)scanf("%d", y + i);

	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;
}
0