#include <iostream>
#include <vector>
using namespace std;
const long long INFINI = 1000ll * 1000 * 1000 * 1000 * 1000ll;
int nbMarches, nbChemins, nbObjets;
int achats[100][1000];
int ventes[100][1000];
long long temps[100][100];
int benefices[100][100];
double valeurs[100][100];
bool estPossible(double 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];
}
}
vector<double> dyn(nbMarches, 0);
bool change = true;
for(int iFois = 0;change;iFois++) {
change = false;
if(iFois > nbMarches)
return true;
for(int iDeb = 0;iDeb < nbMarches;iDeb++) {
for(int iFin = 0;iFin < nbMarches;iFin++) {
if(dyn[iDeb] + valeurs[iDeb][iFin] < dyn[iFin]) {
change = true;
dyn[iFin] = dyn[iDeb] + valeurs[iDeb][iFin];
}
}
}
}
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;
}
}
double deb = 0, fin = 1000000000;
while(fin - deb > 0.0000001) {
double mil = (deb + fin) / 2;
if(estPossible(mil)) {
deb = mil;
}
else {
fin = mil;
}
}
cout << (int)(deb + 0.000001) << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
47 ms |
2544 KB |
Output is correct |
2 |
Incorrect |
20 ms |
1280 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
868 KB |
Output is correct |
2 |
Correct |
5 ms |
896 KB |
Output is correct |
3 |
Correct |
9 ms |
896 KB |
Output is correct |
4 |
Correct |
10 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 |
7 ms |
896 KB |
Output is correct |
8 |
Correct |
8 ms |
896 KB |
Output is correct |
9 |
Correct |
30 ms |
896 KB |
Output is correct |
10 |
Correct |
7 ms |
896 KB |
Output is correct |
11 |
Correct |
8 ms |
896 KB |
Output is correct |
12 |
Correct |
7 ms |
896 KB |
Output is correct |
13 |
Correct |
10 ms |
896 KB |
Output is correct |
14 |
Correct |
13 ms |
896 KB |
Output is correct |
15 |
Correct |
11 ms |
896 KB |
Output is correct |
16 |
Correct |
7 ms |
768 KB |
Output is correct |
17 |
Correct |
10 ms |
916 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
19 |
Execution timed out |
1072 ms |
896 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
42 ms |
1484 KB |
Output is correct |
2 |
Correct |
78 ms |
3064 KB |
Output is correct |
3 |
Correct |
41 ms |
1408 KB |
Output is correct |
4 |
Correct |
36 ms |
1536 KB |
Output is correct |
5 |
Execution timed out |
1059 ms |
1528 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
868 KB |
Output is correct |
2 |
Correct |
5 ms |
896 KB |
Output is correct |
3 |
Correct |
9 ms |
896 KB |
Output is correct |
4 |
Correct |
10 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 |
7 ms |
896 KB |
Output is correct |
8 |
Correct |
8 ms |
896 KB |
Output is correct |
9 |
Correct |
30 ms |
896 KB |
Output is correct |
10 |
Correct |
7 ms |
896 KB |
Output is correct |
11 |
Correct |
8 ms |
896 KB |
Output is correct |
12 |
Correct |
7 ms |
896 KB |
Output is correct |
13 |
Correct |
10 ms |
896 KB |
Output is correct |
14 |
Correct |
13 ms |
896 KB |
Output is correct |
15 |
Correct |
11 ms |
896 KB |
Output is correct |
16 |
Correct |
7 ms |
768 KB |
Output is correct |
17 |
Correct |
42 ms |
1484 KB |
Output is correct |
18 |
Correct |
78 ms |
3064 KB |
Output is correct |
19 |
Correct |
41 ms |
1408 KB |
Output is correct |
20 |
Correct |
36 ms |
1536 KB |
Output is correct |
21 |
Execution timed out |
1059 ms |
1528 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |