Submission #1105663

#TimeUsernameProblemLanguageResultExecution timeMemory
1105663cpptowinSafety (NOI18_safety)C++17
0 / 100
2037 ms88000 KiB
#include <bits/stdc++.h> #define fo(i, d, c) for (int i = d; i <= c; i++) #define fod(i, c, d) for (int i = c; i >= d; i--) #define maxn 1000010 #define N 5010 #define fi first #define se second #define pb emplace_back #define en cout << "\n"; #define bitcount(x) __builtin_popcountll(x) #define pii pair<int, int> #define vii vector<pii> #define lb(x) x & -x #define bit(i, j) ((i >> j) & 1) #define offbit(i, j) (i ^ (1LL << j)) #define onbit(i, j) (i | (1LL << j)) #define vi vector<int> #define all(x) x.begin(), x.end() #define ss(x) (int)x.size() #define UNIQUE(v) v.erase(unique(all(v)),v.end()) template <typename T1, typename T2> bool minimize(T1 &a, T2 b) { if (a > b) { a = b; return true; } return false; } template <typename T1, typename T2> bool maximize(T1 &a, T2 b) { if (a < b) { a = b; return true; } return false; } using namespace std; const int nsqrt = 450; const int mod = 1e9 + 7; void add(int &x, int k) { x += k; x %= mod; if(x < 0) x += mod; } void del(int &x, int k) { x -= k; x %= mod; if(x < 0) x += mod; } struct SegmentTree { vector<int> st; int n; /// real n SegmentTree(int _n = 0) : n(_n) { st.resize(4 * n + 10,0); } void resize(int _n) { n = _n; st.resize(4 * n + 10,0); } void update(int id, int l, int r, int x, int val) { if (x > r or x < l) return; if (l == r) { st[id] += val; return; } int mid = (l + r) >> 1; update(id << 1, l, mid, x, val); update(id << 1 | 1, mid + 1, r, x, val); st[id] = min(st[id << 1], st[id << 1 | 1]); } void assign(int id, int l, int r, int x, int val) { if (x > r or x < l) return; if (l == r) { st[id] = val; return; } int mid = (l + r) >> 1; assign(id << 1, l, mid, x, val); assign(id << 1 | 1, mid + 1, r, x, val); st[id] = min(st[id << 1], st[id << 1 | 1]); } int get(int id, int l, int r, int u, int v) { if (l > v || u > r) return 1e9; if (u <= l && r <= v) return st[id]; int mid = (l + r) >> 1; return min(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v)); } int walkright(int id, int l, int r, int x, int val) { if (st[id] >= val) return -1; if (r < x) return -1; if (l == r) return l; int ans = -1; int mid = (l + r) >> 1; if (st[id << 1] < val) ans = walkright(id << 1, l, mid, x, val); if (ans == -1) ans = walkright(id << 1 | 1, mid + 1, r, x, val); return ans; } int walkleft(int id, int l, int r, int x, int val) { if (st[id] >= val) return -1; if (x < l) return -1; if (l == r) return l; int ans = -1; int mid = (l + r) >> 1; if (st[id << 1 | 1] < val) ans = walkleft(id << 1 | 1, mid + 1, r, x, val); if (ans == -1) ans = walkleft(id << 1, l, mid, x, val); return ans; } int get(int l, int r) { return get(1, 1, n, l, r); } void update(int x, int val) { update(1, 1, n, x, val); } void assign(int x, int val) { assign(1, 1, n, x, val); } int walkleft(int x,int val) { return walkleft(1,1,n,x,val); } int walkright(int x,int val) { return walkright(1,1,n,x,val); } }; int n,a[maxn],f[N][N],lim; main() { #define name "TASK" if (fopen(name ".inp", "r")) { freopen(name ".inp", "r", stdin); freopen(name ".out", "w", stdout); } ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> lim; fo(i,1,n) cin >> a[i]; fo(i,1,n) { SegmentTree st(5050); fo(j,0,5000) st.assign(j,f[i - 1][j]); fo(j,0,5000) f[i][j] = st.get(max(j - lim,0),min(5000,j + lim)) + abs(j - a[i]); } int ans = 1e9; fo(i,0,5000) minimize(ans,f[n][i]); cout << ans; }

Compilation message (stderr)

safety.cpp:161:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  161 | main()
      | ^~~~
safety.cpp: In function 'int main()':
safety.cpp:166:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
safety.cpp:167:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  167 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...