Submission #56287662
Source Code Expand
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define REP_(I,N) for (int I=0,END=(N);I<END;I++)
#define rREP_(I,N) for (int I=(N)-1;I>=0;I--)
#define rep_(I,S,N) for (int I=(S),END=(N);I<END;I++)
#define rrep_(I,S,N) for (int I=(N)-1,START=(S);I>=START;I--)
#define FOR_(I,S,N) for (int I=(S),END=(N);I<=END;I++)
#define rFOR_(I,S,N) for (int I=(N),START=(S);I>=START;I--)
#define DEBUG
#ifdef DEBUG
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define deputs(str) fprintf(stderr, "%s\n",str)
#else
#define debug(...)
#define deputs(str)
#endif // DEBUG
typedef unsigned long long ULL;
typedef unsigned long long ull;
typedef long long LL;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fll;
const LL maxn=2e6+7;
const double pi=acos(-1.0);
const double eps=1e-10;
template<typename T>inline void pr2(T x,int k=64) {REP_(i,k) printf("%d",(x>>i)&1); putchar(' ');}
template<typename T>inline void max_(T &A,T B) {(A<B) &&(A=B);}
template<typename T>inline void min_(T &A,T B) {(A>B) &&(A=B);}
inline ll fastgcd(ll a, ll b) { // __gcd()
if (!b) return a;
ll az=__builtin_ctzll(a),bz=__builtin_ctzll(b),z=min(az,bz),diff; b>>=bz;
while (a) {
a>>=az, diff=b-a, az=__builtin_ctzll(diff);
(b>a)&&(b=a), a=abs(diff);
}
return b<<z;
}
int startTime;
void startTimer() {startTime=clock();}
void printTimer() {debug("/--- Time: %ld milliseconds ---/\n",clock()-startTime);}
typedef array<int,5> ar5;
typedef array<int,4> ar4;
typedef array<int,3> ar3;
std::mt19937 rng(time(0));
std::mt19937_64 rng64(time(0));
vector<pii> direction4 = {{-1,0},{0,-1},{0,1},{1,0}};
vector<pii> direction8 = {{-1,-1},{-1,0},{1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
const int mod = 1e9+7;
// const int mod=998244353;
struct mint {
long long x;
mint():x(0) {}
mint(long long x):x((x%mod+mod)%mod) {}
// mint(long long x):x(x){}
mint &fix() { x = (x%mod+mod)%mod; return *this; }
mint operator-() const { return mint(0) - *this; }
mint operator~() const { return mint(1) / *this; }
mint &operator+=(const mint &a) { if ((x+=a.x)>=mod) x-=mod; return *this; }
mint &operator-=(const mint &a) { if ((x+=mod-a.x)>=mod) x-=mod; return *this; }
mint &operator*=(const mint &a) { (x*=a.x)%=mod; return *this; }
mint &operator/=(const mint &a) { (x*=a.pow(mod-2).x)%=mod; return *this; }
mint operator+(const mint &a)const { return mint(*this) += a; }
mint operator-(const mint &a)const { return mint(*this) -= a; }
mint operator*(const mint &a)const { return mint(*this) *= a; }
mint operator/(const mint &a)const { return mint(*this) /= a; }
mint pow(long long t) const {
mint ret=1,cur=x;
for (; t; t>>=1ll,cur=cur*cur)
if (t&1) ret=ret*cur;
return ret;
}
bool operator<(const mint &a)const { return x < a.x; }
bool operator==(const mint &a)const { return x == a.x; }
};
istream & operator>>(istream &o,mint &a) { o>>a.x; a=a.fix(); return o; }
ostream & operator<<(ostream &o,const mint &a) { o<<a.x; return o; }
int solve() {
int n;
ll m;
scanf("%d%lld",&n,&m);
vector<ll> A(n+1);
FOR_(i,1,n) scanf("%lld",&A[i]);
sort(A.begin()+1,A.end());
ll all=0,res=0;
FOR_(i,0,n) {
all+=A[i];
if (all>m) break;
if (i==n) return 0*puts("infinite");
res=max(res,(m-all)/(n-i));
}
printf("%lld\n",res);
return 0;
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0), cout.tie(0);
int T = 1;
// cin>>T;
// scanf("%d",&T);
startTimer();
FOR_(_, 1, T) { solve(); }
// printTimer();
}
/*
*/
Submission Info
| Submission Time |
|
| Task |
C - Transportation Expenses |
| User |
zlc1114 |
| Language |
C++ 20 (gcc 12.2) |
| Score |
300 |
| Code Size |
3971 Byte |
| Status |
AC |
| Exec Time |
36 ms |
| Memory |
5020 KiB |
Compile Error
Main.cpp: In function ‘int solve()’:
Main.cpp:87:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
87 | scanf("%d%lld",&n,&m);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:89:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
89 | FOR_(i,1,n) scanf("%lld",&A[i]);
| ~~~~~^~~~~~~~~~~~~~
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
300 / 300 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt |
| All |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00_sample_01.txt |
AC |
1 ms |
3868 KiB |
| 00_sample_02.txt |
AC |
1 ms |
3592 KiB |
| 00_sample_03.txt |
AC |
1 ms |
3672 KiB |
| 01_test_01.txt |
AC |
35 ms |
4920 KiB |
| 01_test_02.txt |
AC |
35 ms |
5008 KiB |
| 01_test_03.txt |
AC |
34 ms |
4860 KiB |
| 01_test_04.txt |
AC |
34 ms |
4900 KiB |
| 01_test_05.txt |
AC |
34 ms |
4908 KiB |
| 01_test_06.txt |
AC |
34 ms |
5000 KiB |
| 01_test_07.txt |
AC |
34 ms |
4844 KiB |
| 01_test_08.txt |
AC |
34 ms |
4908 KiB |
| 01_test_09.txt |
AC |
8 ms |
3800 KiB |
| 01_test_10.txt |
AC |
11 ms |
3852 KiB |
| 01_test_11.txt |
AC |
35 ms |
4860 KiB |
| 01_test_12.txt |
AC |
35 ms |
4904 KiB |
| 01_test_13.txt |
AC |
34 ms |
5020 KiB |
| 01_test_14.txt |
AC |
35 ms |
4872 KiB |
| 01_test_15.txt |
AC |
34 ms |
4872 KiB |
| 01_test_16.txt |
AC |
35 ms |
5000 KiB |
| 01_test_17.txt |
AC |
36 ms |
4860 KiB |
| 01_test_18.txt |
AC |
18 ms |
4868 KiB |
| 01_test_19.txt |
AC |
21 ms |
4940 KiB |
| 01_test_20.txt |
AC |
1 ms |
3744 KiB |
| 01_test_21.txt |
AC |
35 ms |
4948 KiB |
| 01_test_22.txt |
AC |
34 ms |
4992 KiB |
| 01_test_23.txt |
AC |
35 ms |
4872 KiB |
| 01_test_24.txt |
AC |
35 ms |
4992 KiB |
| 01_test_25.txt |
AC |
35 ms |
4924 KiB |