제출 #284379

#제출 시각아이디문제언어결과실행 시간메모리
284379_7_7_선물상자 (IOI15_boxes)C++14
100 / 100
648 ms370936 KiB
#include "boxes.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; //#define int long long //#pragma GCC optimize("Ofast") //#pragma comment(linker, "/stack:200000000") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4") #define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout); #define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); #define all(x) x.begin(), x.end() #define sz(s) (int)s.size() #define pb push_back #define ppb pop_back #define mp make_pair #define s second #define f first typedef pair < long long, long long > pll; typedef pair < int, int > pii; typedef unsigned long long ull; typedef vector < pii > vpii; typedef vector < int > vi; typedef long double ldb; typedef long long ll; typedef double db; typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set; const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 1e7 + 12; const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300; const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9); const db eps = 1e-12, pi = acos(-1); const ll INF = 1e18; ll s1[N], s2[N], p1[N], p2[N]; int pos[N]; ll delivery(int n, int k, int l, int p[]) { int j = 0; for (int i = 0; i < n; ++i) { p1[i] = p[i]; p2[i] = l - p[i]; } for (int i = 0; i < n; ++i) { s1[i] = p1[i] + min(p1[i], p2[i]); if (i >= k) s1[i] += s1[i - k]; } for (int i = n - 1; i >= 0; --i) { s2[i] = p2[i] + min(p1[i], p2[i]); if (i + k < n) s2[i] += s2[i + k]; } ll ans = min(s1[n - 1], s2[0]); for (int i = 0; i < n - 1; ++i) ans = min(ans, s1[i] + s2[i + 1]); // for (int i = 0; i < n; ++i) // cerr << s1[i] << ' ' << s2[i] << endl; return ans; }

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:49:9: warning: unused variable 'j' [-Wunused-variable]
   49 |     int j = 0;
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...