oj.uz

Submission #109727

# Submission time Handle Problem Language Result Execution time Memory
109727 2019-05-07T19:05:47 Z Arturgo Travelling Merchant (APIO17_merchant) C++14
100 / 100
 82 ms 3320 KB 
#include <iostream>
#include <vector>
using namespace std;

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

int nbMarches, nbChemins, nbObjets;

int achats[100][1000];
int ventes[100][1000];

long long temps[100][100];
int benefices[100][100];
long long valeurs[100][100];

bool estPossible(long long profit) {
  for(int iDeb = 0;iDeb < nbMarches;iDeb++) {
    for(int iFin = 0;iFin < nbMarches;iFin++) {
      valeurs[iDeb][iFin] = profit * temps[iDeb][iFin] - benefices[iDeb][iFin];
    }
    valeurs[iDeb][iDeb] = INFINI;
  }

  for(int iPivot = 0;iPivot < nbMarches;iPivot++) {
    for(int iDeb = 0;iDeb < nbMarches;iDeb++) {
      for(int iFin = 0;iFin < nbMarches;iFin++) {
	valeurs[iDeb][iFin] = min(valeurs[iDeb][iFin], valeurs[iDeb][iPivot] + valeurs[iPivot][iFin]);
      }
    }
  }

  for(int iMarche = 0;iMarche < nbMarches;iMarche++) {
    if(valeurs[iMarche][iMarche] <= 0)
      return true;
  }

  return false;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin >> nbMarches >> nbChemins >> nbObjets;

  for(int iMarche = 0;iMarche < nbMarches;iMarche++) {
    for(int iObjet = 0;iObjet < nbObjets;iObjet++) {
      cin >> achats[iMarche][iObjet] >> ventes[iMarche][iObjet];
    }
  }

  for(int iDeb = 0;iDeb < nbMarches;iDeb++)
    for(int iFin = 0;iFin < nbMarches;iFin++)
      temps[iDeb][iFin] = INFINI;
  
  for(int iChemin = 0;iChemin < nbChemins;iChemin++) {
    int deb, fin, t;
    cin >> deb >> fin >> t;
    temps[deb - 1][fin - 1] = t;
  }

  for(int iPivot = 0;iPivot < nbMarches;iPivot++) {
    for(int iDeb = 0;iDeb < nbMarches;iDeb++) {
      for(int iFin = 0;iFin < nbMarches;iFin++) {
	temps[iDeb][iFin] = min(temps[iDeb][iFin], temps[iDeb][iPivot] + temps[iPivot][iFin]);
      }
    }
  }

  for(int iDeb = 0;iDeb < nbMarches;iDeb++) {
    for(int iFin = 0;iFin < nbMarches;iFin++) {
      int benefice = 0;
      for(int iObjet = 0;iObjet < nbObjets;iObjet++) {
	if(ventes[iFin][iObjet] != -1 && achats[iDeb][iObjet] != -1)
	  benefice = max(benefice, ventes[iFin][iObjet] - achats[iDeb][iObjet]);
      }
      benefices[iDeb][iFin] = benefice;
    }
  }

  int deb = 0, fin = 1000000000 + 1;
  while(fin - deb > 1) {
    int mil = (deb + fin) / 2;
    if(estPossible(mil)) {
      deb = mil;
    }
    else {
      fin = mil;
    }
  }

  cout << deb << endl;
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1400 KB Output is correct
2 Correct 37 ms 1280 KB Output is correct
3 Correct 39 ms 1280 KB Output is correct
4 Correct 9 ms 768 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 8 ms 884 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 11 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 9 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 940 KB Output is correct
12 Correct 8 ms 768 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 896 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 8 ms 768 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 9 ms 896 KB Output is correct
20 Correct 9 ms 768 KB Output is correct
21 Correct 9 ms 896 KB Output is correct
22 Correct 8 ms 896 KB Output is correct
23 Correct 11 ms 768 KB Output is correct
24 Correct 8 ms 896 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 8 ms 884 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 7 ms 896 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 11 ms 768 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1356 KB Output is correct
2 Correct 78 ms 1276 KB Output is correct
3 Correct 43 ms 1280 KB Output is correct
4 Correct 72 ms 1280 KB Output is correct
5 Correct 56 ms 1280 KB Output is correct
6 Correct 42 ms 1280 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 9 ms 768 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 11 ms 768 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 9 ms 896 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 940 KB Output is correct
12 Correct 8 ms 768 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 9 ms 896 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 43 ms 1356 KB Output is correct
18 Correct 78 ms 1276 KB Output is correct
19 Correct 43 ms 1280 KB Output is correct
20 Correct 72 ms 1280 KB Output is correct
21 Correct 56 ms 1280 KB Output is correct
22 Correct 42 ms 1280 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 9 ms 896 KB Output is correct
26 Correct 9 ms 768 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 8 ms 896 KB Output is correct
29 Correct 11 ms 768 KB Output is correct
30 Correct 47 ms 1280 KB Output is correct
31 Correct 54 ms 1408 KB Output is correct
32 Correct 63 ms 1844 KB Output is correct
33 Correct 45 ms 1528 KB Output is correct
34 Correct 45 ms 1408 KB Output is correct
35 Correct 46 ms 1408 KB Output is correct
36 Correct 68 ms 3220 KB Output is correct
37 Correct 3 ms 512 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 42 ms 1344 KB Output is correct
40 Correct 44 ms 1408 KB Output is correct
41 Correct 44 ms 1280 KB Output is correct
42 Correct 44 ms 1280 KB Output is correct
43 Correct 38 ms 1400 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 9 ms 984 KB Output is correct
46 Correct 10 ms 896 KB Output is correct
47 Correct 10 ms 896 KB Output is correct
48 Correct 81 ms 3320 KB Output is correct
49 Correct 82 ms 3320 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 66 ms 1400 KB Output is correct
52 Correct 37 ms 1280 KB Output is correct
53 Correct 39 ms 1280 KB Output is correct
54 Correct 9 ms 768 KB Output is correct
55 Correct 11 ms 896 KB Output is correct
56 Correct 8 ms 896 KB Output is correct
57 Correct 9 ms 896 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 8 ms 884 KB Output is correct
60 Correct 9 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 11 ms 768 KB Output is correct