제출 #364064

#제출 시각아이디문제언어결과실행 시간메모리
364064knightron0선물상자 (IOI15_boxes)C++14
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define fr first #define sc second #define clr(a, x) memset(a, x, sizeof(a)) #define dbg(x) cout<<"("<<#x<<"): "<<x<<endl; #define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl; #define all(v) v.begin(), v.end() #define lcm(a, b) (a * b)/__gcd(a, b) #define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl; #define endl '\n' #define float long double const int MOD = 1e9 + 7; const int MAXN = 1e5 + 5; long long int delivery(int N, int k, int l, int positions[]) { int mx = 0; int mn = INT_MAX; for(int i= 0;i<N;i++){ mx = max(mx, positions[i]); mn = min(mn, positions[i]); } int dist1 = mx*2; int dist2 = abs(l-mn)*2; return min({l, dist1, dist2}); } // signed main() { // ios_base::sync_with_stdio(false); // cin.tie(NULL); // #ifdef LOCAL // freopen("input.txt", "r", stdin); // #endif // int n, k, l; // cin>>n>>k>>l; // int pos[n]; // for(int i= 0;i<n;i++){ // cin>>pos[i]; // } // cout<<delivery(n, k, l, pos)<<endl; // return 0; // }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:35: warning: unused parameter 'k' [-Wunused-parameter]
   20 | long long int delivery(int N, int k, int l, int positions[]) {
      |                               ~~~~^
#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...