Submission #582752

#TimeUsernameProblemLanguageResultExecution timeMemory
582752MohamedFaresNebiliBoxes with souvenirs (IOI15_boxes)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; using ll = long long; using pi = pair<ll, pair<ll, ll>>; using ii = pair<int, int>; #define pb push_back #define pp pop_back #define ff first #define ss second typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; int delivery(int N, int K, int L, int P[]) { ll res = 0; for(int l = 0; l < N; l++) { res += min({2 * P[l], 2 * (L - P[l]), L}); } return res; }

Compilation message (stderr)

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:24:20: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   24 |             return res;
      |                    ^~~
boxes.cpp:19:33: warning: unused parameter 'K' [-Wunused-parameter]
   19 |         int delivery(int N, int K, int L, int P[]) {
      |                             ~~~~^
#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...