結果
問題 | No.1139 Slime Race |
ユーザー |
![]() |
提出日時 | 2020-07-31 21:53:34 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 4,702 bytes |
コンパイル時間 | 1,532 ms |
コンパイル使用メモリ | 167,656 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-02 08:21:14 |
合計ジャッジ時間 | 2,641 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define X first#define Y second#define mp make_pair#define pb push_back#define rep(i,a,n) for(int i=(a);i<=(n);++i)#define dep(i,a,n) for(int i=(a);i>=(n);--i)#define eps 1e-8#define pi 3.1415926535897#define sqr(x) ((x)*(x))#define SZ(x) ((int)(x).size())#define CPY(a,b) memcpy(a,b,sizeof(a))#define CLR(a) memset(a,0,sizeof(a))#define POSIN(x,y) (1<=(x)&&(x)<=m&&1<=(y)&&(y)<=n)#define ALL(x) (x).begin(),(x).end()#define COUT(S,x) cout<<fixed<<setprecision(x)<<S<<endl#define buli(x) (__builtin_popcountll(x))#define bur0(x) (__builtin_ctzll(x))#define bul2(x) (63-__builtin_clzll(x))#define pw(x) ((ll(1))<<(x))#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))#define y0 y0z#define y1 y1z#define yn ynz#define j0 j0z#define j1 j1z#define jn jnz#define tm tmz#ifdef LOCAL#define debug(...) fprintf(stderr, __VA_ARGS__)#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;#else#define debug(...)#define dbg(x)#endiftemplate<typename T> bool MAX(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template<typename T> bool MIN(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second+ r.second); }template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second- r.second); }template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}";return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; returnos; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }typedef long long ll;typedef double lf;typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef pair<lf,lf> pff;typedef complex<double> CD;typedef vector<int> VI;typedef vector<ll> VL;const int inf=0x3f3f3f3f;const int mo=1000000007;inline void gn(long long&x){int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;}inline void gn(int&x){long long t;gn(t);x=t;}inline void gn(unsigned long long&x){long long t;gn(t);x=t;}inline void gn(double&x){double t;scanf("%lf",&t);x=t;}inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}template<class T1,class T2>inline void gn(T1&r,T2&s){gn(r),gn(s);}template<class T1,class T2,class T3>inline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);}template<class T1,class T2,class T3,class T4>inline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);}inline void gs(char *s){scanf("%s",s);}inline void gc(char &c){while((c=getchar())>126 || c<33);}inline void pc(char c){putchar(c);}const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}//*******************************************const int N=111111,M=111111;int l,m,n,t,C;int main(){#ifdef LOCALfreopen("A.in","r",stdin);//freopen("A.out","w",stdout);#endifscanf("%d%d",&n,&m);ll s=0;rep(i,1,n)scanf("%*d");rep(i,1,n)scanf("%d",&t),s+=t;printf("%d\n",(m+s-1)/s);return 0;}