제출 #1100961

#제출 시각아이디문제언어결과실행 시간메모리
1100961akzytrStove (JOI18_stove)C++17
50 / 100
1058 ms1104 KiB
#include <bits/stdc++.h> using namespace std; template <typename T> using ve = vector<T>; typedef long long ll; #define pb push_back #define fi first #define se second #define endl '\n' int main() { int N, K; cin >> N >> K; ve<pair<int, int>> times(N); for(int i = 0; i < N; i++) { scanf("%d", &times[i].fi); times[i].se = 1; } int mi_left[K + 1] = {}; int mi_left2[K + 1] = {}; bool tk = false; const int MXN = 1e9; for(int i = 0; i <= K; i++) { mi_left[i] = 0; mi_left2[i] = MXN; } for(int i = N - 1; i >= 0; i--) { if(i == N - 1 || times[i].fi + 1 != times[i + 1].fi) { for(int left = K; left >= 0; left--) { mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (int)MXN) + times[i].fi + 1); if(left == 0) { break; } mi_left2[left] = min(mi_left2[left], mi_left[left] + times[i].fi + 1); } } tk = 1; for(int left = K; left >= 0; left--) { mi_left2[left] = min(mi_left2[left], (int)MXN + times[i].fi); if(left == 0) { break; } mi_left[left] = min((int)MXN, mi_left2[left - 1] - times[i].fi); } } cout << mi_left[K] << endl; }

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

stove.cpp: In function 'int main()':
stove.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   scanf("%d", &times[i].fi);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...