제출 #430964

#제출 시각아이디문제언어결과실행 시간메모리
430964Collypso선물상자 (IOI15_boxes)C++17
10 / 100
1 ms268 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define pii pair<int, int> #define pll pair<ll, ll> #define vt vector #define pb push_back #define all(x) (x).begin(), (x).end() #define sz(x) (int) (x).size() #pragma GCC optimize ("O3") #pragma GCC optimize ("O2") #define F first #define S second //#define endl '\n' //#define int long long using namespace std; ll delivery(int N, int K, int L, int p[]) { if (K == 1) { ll ans = 0; for(int i = 0; i < N; i++) ans += 2 * min(p[i], L - p[i]); return ans; } if (K == N) { vt<int> v, pos; for(int i = 0; i < N; i++) v.pb(p[i]); sort(all(v)); pos.pb(v[0]); for(int i = 1; i < N; i++) if (v[i] != *pos.rbegin()) pos.pb(v[i]); for(int x : pos) cout << x << " "; cout << endl; int mn = L; for(int i = 0; i < sz(pos) - 1; i++) mn = min(mn, 2 * pos[i] + 2 * (L - pos[i])); mn = min(mn, 2 * (L - pos[0])); mn = min(mn, 2 * (*pos.rbegin())); return mn; } }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^
#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...