답안 #588063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
588063	2022-07-02T16:55:58 Z	Mounir	Self Study (JOI22_ho_t2)	C++14	0 / 100	345 ms	10696 KB

Main

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;

const int N = 1e6;
int nCours, nWeeks;
int a[N], b[N];

bool isOk(int bInf){
      int aAllouer = 0;
      for (int iCours = 0; iCours < nCours; ++iCours){
            int besoin = ceil(bInf/double(a[iCours]));
            if (besoin <= nWeeks)
                  aAllouer += nWeeks - besoin;
            else {
                  int reste = bInf - nWeeks * a[iCours];
                  reste = ceil(double(reste)/b[iCours]);
                  aAllouer -= reste;
            }
      }

    //  cout << aAllouer
      return aAllouer >= 0;
}

signed main(){ 
      cin >> nCours >> nWeeks;
      for (int i = 0; i < nCours; ++i)
            cin >> a[i];
      for (int i = 0; i < nCours; ++i){
            cin >> b[i];
            chmax(a[i], b[i]);
      }

      int gauche = 0, droite = 1e18;
      while (droite > gauche){
            int mid = (gauche + droite)/2 + 1;
            if (isOk(mid))
                  gauche = mid;
            else
                  droite = mid - 1;
      }
      cout << gauche << endl;
      return 0;   
}

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	7 ms	448 KB	Output is correct
11	Correct	345 ms	10696 KB	Output is correct
12	Correct	286 ms	10692 KB	Output is correct
13	Correct	261 ms	8780 KB	Output is correct
14	Incorrect	231 ms	8724 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	165 ms	5508 KB	Output is correct
10	Correct	98 ms	3788 KB	Output is correct
11	Correct	75 ms	2916 KB	Output is correct
12	Correct	60 ms	2360 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	260 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	3 ms	316 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	7 ms	448 KB	Output is correct
11	Correct	345 ms	10696 KB	Output is correct
12	Correct	286 ms	10692 KB	Output is correct
13	Correct	261 ms	8780 KB	Output is correct
14	Incorrect	231 ms	8724 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	165 ms	5508 KB	Output is correct
10	Correct	98 ms	3788 KB	Output is correct
11	Correct	75 ms	2916 KB	Output is correct
12	Correct	60 ms	2360 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	260 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	3 ms	316 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	7 ms	448 KB	Output is correct
11	Correct	345 ms	10696 KB	Output is correct
12	Correct	286 ms	10692 KB	Output is correct
13	Correct	261 ms	8780 KB	Output is correct
14	Incorrect	231 ms	8724 KB	Output isn't correct
15	Halted	0 ms	0 KB	-