oj.uz

Submission #63110

# Submission time Handle Problem Language Result Execution time Memory
63110 2018-07-31T18:29:03 Z Arturgo Arranging Tickets (JOI17_arranging_tickets) C++11
100 / 100
 2726 ms 49220 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
using namespace std;

const long long INFINI = 1000ll * 1000ll * 1000ll * 1000ll * 1000ll;

struct Inter {
  int deb, fin, num;
  Inter(int _deb = 0, int _fin = 0, int _num = 0) {
    deb = _deb;
    fin = _fin;
    num = _num;
  }
};

bool operator < (const Inter &a, const Inter &b) {
  return a.fin < b.fin;
}

int nbStations, nbReqs;
long long hauteurs[300*1000];
vector<Inter> inters[300*1000];

bool check(long long maxi, int pos, long long nbInvs) {
  vector<long long> invs(nbStations, 0);

  priority_queue<Inter> ouverts;
  
  long long nbOuverts = 0;
  
  for(int iStation = 0;iStation <= pos;iStation++) {
    for(Inter inter : inters[iStation]) {
      if(inter.fin > pos) {
	ouverts.push(inter);
      }
    }
    
    long long besoin = (hauteurs[iStation] + nbInvs - maxi + 1) / 2;
    if(iStation == pos) {
      besoin = nbInvs;
    }

    long long doitOuvrir = max(0ll, besoin - nbOuverts);
    nbOuverts += doitOuvrir;
    
    while(doitOuvrir > 0) {
      if(ouverts.empty())
	return false;
      Inter mel = ouverts.top();
      ouverts.pop();

      long long nbPose = min<long long>(mel.num, doitOuvrir);

      invs[0] += nbPose;
      invs[mel.deb] -= 2 * nbPose;
      invs[mel.fin] += 2 * nbPose;

      mel.num -= nbPose;
      doitOuvrir -= nbPose;

      if(mel.num != 0) {
	ouverts.push(mel);
      }
    }
  }

  if(hauteurs[0] + invs[0] > maxi)
    return false;
  
  for(int iStation = 1;iStation < nbStations;iStation++) {
    invs[iStation] += invs[iStation - 1];
    if(hauteurs[iStation] + invs[iStation] > maxi)
      return false;
  }
  return true;
}

bool estPossible(long long maxTickets) {
  int maxGauche = 0;
  int maxDroite = 0;

  for(int iStation = 0;iStation < nbStations;iStation++) {
    if(hauteurs[iStation] > hauteurs[maxGauche]) {
      maxGauche = iStation;
    }
    if(hauteurs[iStation] >= hauteurs[maxDroite]) {
      maxDroite = iStation;
    }
  }

  if(hauteurs[maxGauche] <= maxTickets)
    return true;

  return check(maxTickets, maxGauche, hauteurs[maxGauche] - maxTickets) ||
    check(maxTickets, maxGauche, hauteurs[maxGauche] - maxTickets + 1) ||
    check(maxTickets, maxDroite, hauteurs[maxDroite] - maxTickets) ||
    check(maxTickets, maxDroite, hauteurs[maxDroite] - maxTickets + 1);
}

int main() {
  scanf("%d%d", &nbStations, &nbReqs);

  for(int iReq = 0;iReq < nbReqs;iReq++) {
    int deb, fin, num;
    scanf("%d%d%d", &deb, &fin, &num);

    if(fin < deb)
      swap(deb, fin);
    
    deb--; fin--;
    hauteurs[deb] += num;
    hauteurs[fin] -= num;
    inters[deb].push_back(Inter(deb, fin, num));
    inters[fin].push_back(Inter(deb, fin, num));
  }

  for(int iStation = 1;iStation < nbStations;iStation++) {
    hauteurs[iStation] += hauteurs[iStation - 1];
  }

  long long deb = 0, fin = INFINI;

  while(fin - deb > 1) {
    long long mil = (deb + fin) / 2;
    if(estPossible(mil)) {
      fin = mil;
    }
    else {
      deb = mil;
    }
  }

  printf("%lld\n", deb + 1);
  
  return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &nbStations, &nbReqs);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
arranging_tickets.cpp:107:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &deb, &fin, &num);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 11 ms 7504 KB Output is correct
3 Correct 12 ms 7556 KB Output is correct
4 Correct 10 ms 7560 KB Output is correct
5 Correct 10 ms 7608 KB Output is correct
6 Correct 9 ms 7740 KB Output is correct
7 Correct 10 ms 7740 KB Output is correct
8 Correct 10 ms 7740 KB Output is correct
9 Correct 9 ms 7740 KB Output is correct
10 Correct 8 ms 7740 KB Output is correct
11 Correct 9 ms 7740 KB Output is correct
12 Correct 9 ms 7740 KB Output is correct
13 Correct 7 ms 7748 KB Output is correct
14 Correct 12 ms 7752 KB Output is correct
15 Correct 8 ms 7756 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 11 ms 7504 KB Output is correct
3 Correct 12 ms 7556 KB Output is correct
4 Correct 10 ms 7560 KB Output is correct
5 Correct 10 ms 7608 KB Output is correct
6 Correct 9 ms 7740 KB Output is correct
7 Correct 10 ms 7740 KB Output is correct
8 Correct 10 ms 7740 KB Output is correct
9 Correct 9 ms 7740 KB Output is correct
10 Correct 8 ms 7740 KB Output is correct
11 Correct 9 ms 7740 KB Output is correct
12 Correct 9 ms 7740 KB Output is correct
13 Correct 7 ms 7748 KB Output is correct
14 Correct 12 ms 7752 KB Output is correct
15 Correct 8 ms 7756 KB Output is correct
16 Correct 8 ms 7816 KB Output is correct
17 Correct 8 ms 7820 KB Output is correct
18 Correct 11 ms 7824 KB Output is correct
19 Correct 11 ms 7828 KB Output is correct
20 Correct 10 ms 7940 KB Output is correct
21 Correct 11 ms 7940 KB Output is correct
22 Correct 11 ms 7940 KB Output is correct
23 Correct 10 ms 7940 KB Output is correct
24 Correct 10 ms 7948 KB Output is correct
25 Correct 9 ms 7948 KB Output is correct
26 Correct 10 ms 7948 KB Output is correct
27 Correct 10 ms 7948 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 11 ms 7504 KB Output is correct
3 Correct 12 ms 7556 KB Output is correct
4 Correct 10 ms 7560 KB Output is correct
5 Correct 10 ms 7608 KB Output is correct
6 Correct 9 ms 7740 KB Output is correct
7 Correct 10 ms 7740 KB Output is correct
8 Correct 10 ms 7740 KB Output is correct
9 Correct 9 ms 7740 KB Output is correct
10 Correct 8 ms 7740 KB Output is correct
11 Correct 9 ms 7740 KB Output is correct
12 Correct 9 ms 7740 KB Output is correct
13 Correct 7 ms 7748 KB Output is correct
14 Correct 12 ms 7752 KB Output is correct
15 Correct 8 ms 7756 KB Output is correct
16 Correct 8 ms 7816 KB Output is correct
17 Correct 8 ms 7820 KB Output is correct
18 Correct 11 ms 7824 KB Output is correct
19 Correct 11 ms 7828 KB Output is correct
20 Correct 10 ms 7940 KB Output is correct
21 Correct 11 ms 7940 KB Output is correct
22 Correct 11 ms 7940 KB Output is correct
23 Correct 10 ms 7940 KB Output is correct
24 Correct 10 ms 7948 KB Output is correct
25 Correct 9 ms 7948 KB Output is correct
26 Correct 10 ms 7948 KB Output is correct
27 Correct 10 ms 7948 KB Output is correct
28 Correct 13 ms 8124 KB Output is correct
29 Correct 14 ms 8156 KB Output is correct
30 Correct 13 ms 8208 KB Output is correct
31 Correct 16 ms 8208 KB Output is correct
32 Correct 18 ms 8312 KB Output is correct
33 Correct 18 ms 8312 KB Output is correct
34 Correct 15 ms 8400 KB Output is correct
35 Correct 18 ms 8400 KB Output is correct
36 Correct 16 ms 8400 KB Output is correct
37 Correct 15 ms 8400 KB Output is correct
38 Correct 12 ms 8424 KB Output is correct
39 Correct 11 ms 8460 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 11 ms 7504 KB Output is correct
3 Correct 12 ms 7556 KB Output is correct
4 Correct 10 ms 7560 KB Output is correct
5 Correct 10 ms 7608 KB Output is correct
6 Correct 9 ms 7740 KB Output is correct
7 Correct 10 ms 7740 KB Output is correct
8 Correct 10 ms 7740 KB Output is correct
9 Correct 9 ms 7740 KB Output is correct
10 Correct 8 ms 7740 KB Output is correct
11 Correct 9 ms 7740 KB Output is correct
12 Correct 9 ms 7740 KB Output is correct
13 Correct 7 ms 7748 KB Output is correct
14 Correct 12 ms 7752 KB Output is correct
15 Correct 8 ms 7756 KB Output is correct
16 Correct 8 ms 7816 KB Output is correct
17 Correct 8 ms 7820 KB Output is correct
18 Correct 11 ms 7824 KB Output is correct
19 Correct 11 ms 7828 KB Output is correct
20 Correct 10 ms 7940 KB Output is correct
21 Correct 11 ms 7940 KB Output is correct
22 Correct 11 ms 7940 KB Output is correct
23 Correct 10 ms 7940 KB Output is correct
24 Correct 10 ms 7948 KB Output is correct
25 Correct 9 ms 7948 KB Output is correct
26 Correct 10 ms 7948 KB Output is correct
27 Correct 10 ms 7948 KB Output is correct
28 Correct 13 ms 8124 KB Output is correct
29 Correct 14 ms 8156 KB Output is correct
30 Correct 13 ms 8208 KB Output is correct
31 Correct 16 ms 8208 KB Output is correct
32 Correct 18 ms 8312 KB Output is correct
33 Correct 18 ms 8312 KB Output is correct
34 Correct 15 ms 8400 KB Output is correct
35 Correct 18 ms 8400 KB Output is correct
36 Correct 16 ms 8400 KB Output is correct
37 Correct 15 ms 8400 KB Output is correct
38 Correct 12 ms 8424 KB Output is correct
39 Correct 11 ms 8460 KB Output is correct
40 Correct 376 ms 18640 KB Output is correct
41 Correct 358 ms 20336 KB Output is correct
42 Correct 265 ms 21652 KB Output is correct
43 Correct 713 ms 22856 KB Output is correct
44 Correct 403 ms 24528 KB Output is correct
45 Correct 762 ms 25916 KB Output is correct
46 Correct 303 ms 26884 KB Output is correct
47 Correct 364 ms 28244 KB Output is correct
48 Correct 382 ms 29580 KB Output is correct
49 Correct 275 ms 29580 KB Output is correct
50 Correct 120 ms 29580 KB Output is correct
51 Correct 165 ms 30616 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 11 ms 7504 KB Output is correct
3 Correct 12 ms 7556 KB Output is correct
4 Correct 10 ms 7560 KB Output is correct
5 Correct 10 ms 7608 KB Output is correct
6 Correct 9 ms 7740 KB Output is correct
7 Correct 10 ms 7740 KB Output is correct
8 Correct 10 ms 7740 KB Output is correct
9 Correct 9 ms 7740 KB Output is correct
10 Correct 8 ms 7740 KB Output is correct
11 Correct 9 ms 7740 KB Output is correct
12 Correct 9 ms 7740 KB Output is correct
13 Correct 7 ms 7748 KB Output is correct
14 Correct 12 ms 7752 KB Output is correct
15 Correct 8 ms 7756 KB Output is correct
16 Correct 8 ms 7816 KB Output is correct
17 Correct 8 ms 7820 KB Output is correct
18 Correct 11 ms 7824 KB Output is correct
19 Correct 11 ms 7828 KB Output is correct
20 Correct 10 ms 7940 KB Output is correct
21 Correct 11 ms 7940 KB Output is correct
22 Correct 11 ms 7940 KB Output is correct
23 Correct 10 ms 7940 KB Output is correct
24 Correct 10 ms 7948 KB Output is correct
25 Correct 9 ms 7948 KB Output is correct
26 Correct 10 ms 7948 KB Output is correct
27 Correct 10 ms 7948 KB Output is correct
28 Correct 13 ms 8124 KB Output is correct
29 Correct 14 ms 8156 KB Output is correct
30 Correct 13 ms 8208 KB Output is correct
31 Correct 16 ms 8208 KB Output is correct
32 Correct 18 ms 8312 KB Output is correct
33 Correct 18 ms 8312 KB Output is correct
34 Correct 15 ms 8400 KB Output is correct
35 Correct 18 ms 8400 KB Output is correct
36 Correct 16 ms 8400 KB Output is correct
37 Correct 15 ms 8400 KB Output is correct
38 Correct 12 ms 8424 KB Output is correct
39 Correct 11 ms 8460 KB Output is correct
40 Correct 376 ms 18640 KB Output is correct
41 Correct 358 ms 20336 KB Output is correct
42 Correct 265 ms 21652 KB Output is correct
43 Correct 713 ms 22856 KB Output is correct
44 Correct 403 ms 24528 KB Output is correct
45 Correct 762 ms 25916 KB Output is correct
46 Correct 303 ms 26884 KB Output is correct
47 Correct 364 ms 28244 KB Output is correct
48 Correct 382 ms 29580 KB Output is correct
49 Correct 275 ms 29580 KB Output is correct
50 Correct 120 ms 29580 KB Output is correct
51 Correct 165 ms 30616 KB Output is correct
52 Correct 941 ms 36492 KB Output is correct
53 Correct 901 ms 38696 KB Output is correct
54 Correct 2697 ms 41024 KB Output is correct
55 Correct 807 ms 43120 KB Output is correct
56 Correct 2476 ms 45332 KB Output is correct
57 Correct 2726 ms 47092 KB Output is correct
58 Correct 829 ms 49220 KB Output is correct
59 Correct 1010 ms 49220 KB Output is correct