oj.uz

답안 #462522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
462522 2021-08-10T17:06:15 Z Mounir Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 10236 KB 
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<int, int>
#define deb first
#define fin second
#define int long long
using namespace std;
 
const int N = 5e5, OO = 1e18;
vector<int> debs, fins;
int nBoules, nJours;
 
int getInstant(int posInter, int posBoule){
      int delta = -(posBoule - posInter);
      if (delta < 0)
            return lower_bound(debs.begin(), debs.end(), -delta) - debs.begin();
      else
            return upper_bound(fins.begin(), fins.end(), delta) - fins.begin();
}
 
 
signed main(){ 
      ios::sync_with_stdio(false);
      cin.tie(nullptr);
      cout.tie(nullptr);
 
      cin >> nBoules >> nJours;
      vector<int> boules(nBoules);
      for (int& boule : boules)
            cin >> boule;
 
      debs.resize(nJours + 1);
      fins.resize(nJours + 1);

      int posCur = 0;
      debs[0] = 0; fins[0] = -1;
      for (int iJour = 1; iJour <= nJours; ++iJour){
            int delta; cin >> delta;
            posCur += delta;
            debs[iJour] = -min(-debs[iJour - 1], posCur);
            fins[iJour] = max(0ll, max(posCur, fins[iJour - 1]));
      }

    //  int debut[nBoules];
 
      for (int iBoule = 0; iBoule < nBoules; ++iBoule){
            int gauche = boules[iBoule] - debs[nJours], droite = boules[iBoule]; //Gauche
 
            while (droite > gauche){
                  int mid = floor((gauche + droite)/double(2));
                  int moment = getInstant(mid, boules[iBoule]);
 
                  if (moment <= nJours && (iBoule == 0 || moment < getInstant(mid, boules[iBoule - 1])))
                        droite = mid;
                  else
                        gauche = mid + 1;
            }

           // debut[iBoule] = ga
 
            int deb = gauche;
            gauche = boules[iBoule] - 1, droite = boules[iBoule] + fins[nJours];
            while (droite > gauche){
                  int mid =  floor((gauche + droite)/double(2)) + 1;
                //  cout << "dicho " << gauche << " " << droite << " " << mid << endl;
                  //cout << getInstant(mid, boules[iBoule]) << endl << endl;
                  int moment = getInstant(mid, boules[iBoule]);
 
                  if (moment <= nJours && (iBoule == nBoules - 1 || moment < getInstant(mid, boules[iBoule + 1])))
                        gauche = mid;
                  else
                        droite = mid - 1;
            }
            
            cout << gauche - deb + 1 << endl;
        //    cout << couverts[iBoule].deb << " " << couverts[iBoule].fin << endl;
      }
      return 0;
 
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 15 ms 364 KB Output is correct
5 Correct 13 ms 368 KB Output is correct
6 Correct 11 ms 332 KB Output is correct
7 Correct 11 ms 368 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 9 ms 332 KB Output is correct
10 Correct 5 ms 324 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 2 ms 312 KB Output is correct
15 Correct 15 ms 408 KB Output is correct
16 Correct 14 ms 412 KB Output is correct
17 Correct 11 ms 416 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 4 ms 332 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 15 ms 364 KB Output is correct
5 Correct 13 ms 368 KB Output is correct
6 Correct 11 ms 332 KB Output is correct
7 Correct 11 ms 368 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 9 ms 332 KB Output is correct
10 Correct 5 ms 324 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 2 ms 312 KB Output is correct
15 Correct 15 ms 408 KB Output is correct
16 Correct 14 ms 412 KB Output is correct
17 Correct 11 ms 416 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 32 ms 5444 KB Output is correct
21 Correct 32 ms 5308 KB Output is correct
22 Correct 34 ms 5060 KB Output is correct
23 Correct 51 ms 4932 KB Output is correct
24 Correct 255 ms 5432 KB Output is correct
25 Correct 2223 ms 10236 KB Output is correct
26 Correct 2196 ms 6492 KB Output is correct
27 Correct 2121 ms 6308 KB Output is correct
28 Correct 2090 ms 6336 KB Output is correct
29 Correct 1963 ms 6160 KB Output is correct
30 Correct 1348 ms 5696 KB Output is correct
31 Correct 484 ms 5360 KB Output is correct
32 Correct 433 ms 5396 KB Output is correct
33 Correct 176 ms 940 KB Output is correct
34 Correct 2101 ms 6676 KB Output is correct
35 Correct 2039 ms 6372 KB Output is correct
36 Correct 2309 ms 6548 KB Output is correct
37 Correct 2090 ms 6312 KB Output is correct
38 Correct 2136 ms 6388 KB Output is correct
39 Correct 2147 ms 6340 KB Output is correct
40 Correct 1393 ms 6368 KB Output is correct
41 Execution timed out 2545 ms 3404 KB Time limit exceeded
42 Halted 0 ms 0 KB -