oj.uz

Submission #462512

# Submission time Handle Problem Language Result Execution time Memory
462512 2021-08-10T16:48:39 Z Mounir Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 10696 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;
pii inters[N];
int nBoules, nJours;
 
int getInstant(int posInter, int posBoule){
      int delta = -(posBoule - posInter);
      int gauche = 0, droite = nJours + 1;
      while (droite > gauche){
            int mid = (gauche + droite)/2;
            if (inters[mid].deb <= delta && inters[mid].fin > delta)
                  droite = mid;
            else
                  gauche = mid + 1;
      }
      return gauche;
}
 
 
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;
 
      int posCur = 0;
      inters[0] = {0, -1};
      for (int iJour = 1; iJour <= nJours; ++iJour){
            int delta; cin >> delta;
            posCur += delta;
            inters[iJour] = {min(inters[iJour - 1].deb, posCur), max(max(inters[iJour - 1].fin, posCur), 0ll)};
           // cout << "inter " << inters[iJour].deb << " " << inters[iJour].fin << endl;
      }

      for (int iBoule = 0; iBoule < nBoules; ++iBoule){
            int gauche = boules[iBoule] + inters[nJours].deb, droite = boules[iBoule]; //Gauche
 
            while (droite > gauche){
                  int mid = floor((gauche + droite)/double(2));
              ///    cout << "dicho " << gauche << " " << droite << " " << mid << endl;
 
                  int moment = getInstant(mid, boules[iBoule]);

                  if (moment <= nJours && (iBoule == 0 || moment < getInstant(mid, boules[iBoule - 1])))
                        droite = mid;
                  else
                        gauche = mid + 1;
            }
 
            int deb = gauche;
            gauche = boules[iBoule] - 1, droite = boules[iBoule] + inters[nJours].fin;
            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

# Verdict Execution time Memory 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 16 ms 368 KB Output is correct
5 Correct 14 ms 380 KB Output is correct
6 Correct 13 ms 332 KB Output is correct
7 Correct 11 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 9 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 16 ms 332 KB Output is correct
16 Correct 15 ms 380 KB Output is correct
17 Correct 12 ms 368 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 4 ms 332 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory 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 16 ms 368 KB Output is correct
5 Correct 14 ms 380 KB Output is correct
6 Correct 13 ms 332 KB Output is correct
7 Correct 11 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 9 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 16 ms 332 KB Output is correct
16 Correct 15 ms 380 KB Output is correct
17 Correct 12 ms 368 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 32 ms 3396 KB Output is correct
21 Correct 30 ms 3432 KB Output is correct
22 Correct 32 ms 3308 KB Output is correct
23 Correct 52 ms 3472 KB Output is correct
24 Correct 279 ms 3752 KB Output is correct
25 Correct 2450 ms 6680 KB Output is correct
26 Correct 2436 ms 10360 KB Output is correct
27 Correct 2288 ms 9928 KB Output is correct
28 Correct 2202 ms 10088 KB Output is correct
29 Correct 2037 ms 9672 KB Output is correct
30 Correct 1366 ms 8964 KB Output is correct
31 Correct 467 ms 8388 KB Output is correct
32 Correct 388 ms 8520 KB Output is correct
33 Correct 194 ms 1356 KB Output is correct
34 Correct 2255 ms 10696 KB Output is correct
35 Correct 2215 ms 10052 KB Output is correct
36 Correct 2467 ms 10332 KB Output is correct
37 Correct 2274 ms 10012 KB Output is correct
38 Correct 2268 ms 10240 KB Output is correct
39 Correct 2267 ms 10088 KB Output is correct
40 Correct 1533 ms 10052 KB Output is correct
41 Execution timed out 2585 ms 6148 KB Time limit exceeded
42 Halted 0 ms 0 KB -