oj.uz

답안 #653053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653053 2022-10-25T14:32:02 Z ayalla 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 83 ms 4300 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long int
#define endl '\n'
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pi>
#define fir first
#define sec second
#define MAXN 100005
#define mod 1000000007

const int inf = LLONG_MAX / 2;

int n, m, k;
int b[101][1001];
int s[101][1001];
int cost[101][101];
int stonks[101][101];
int g[101][101];
vector<int> adj[101];

void floyd(int dist[101][101])
{
  for (int k = 0; k < n; k++)
  {
    for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
    }
  }
}
bool can(int mid)
{
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
      g[i][j] = -(stonks[i][j] - (min(cost[i][j], inf / mid) * mid));
  }
  // nesse grafo, agr quero saber se existe um ciclo que a soma dos custos das arestas eh >= 0
  floyd(g);
  for (int i = 0; i < n; i++)
  {
    if (g[i][i] <= 0)
      return 1;
  }
  return 0;
}
signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < k; j++)
      cin >> b[i][j] >> s[i][j];
  }
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
      cost[i][j] = inf;
  }
  for (int j = 0; j < m; j++)
  {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    adj[a].pb(b);
    cost[a][b] = c;
  }
  floyd(cost);
  for (int i = 0; i < n; i++)
  {
    for (int j = 0; j < n; j++)
    {
      for (int x = 0; x < k; x++)
      {
        if (s[j][x] == -1 || b[i][x] == -1)
          continue;
        stonks[i][j] = max(stonks[i][j], s[j][x] - b[i][x]);
      }
    }
  }
  int l = 0, r = 1e9;
  while (l < r)
  {
    int mid = (l + r + 1) >> 1;
    (can(mid)) ? l = mid : r = mid - 1;
  }
  cout << l << endl;
  return 0;
}
// n mercados
// m arestas de mao unica
// k diferentes items
// cada item tem
// b[i][j] - buy o item j no mercado i
// s[i][j] - sell o item j no mercado i
// arestas de v pra w usando t de tempo

// uma ideia eh
// pensar em resolver pra cada componente fortemente conexa

// busca binaria na resposta
// p / t >= mid
// entao
// p - (t * mid) >= 0

// 0 3 2 0

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 2004 KB Output is correct
2 Correct 36 ms 1292 KB Output is correct
3 Correct 30 ms 1236 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 6 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 5 ms 892 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 6 ms 852 KB Output is correct
31 Correct 5 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 5 ms 892 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 37 ms 1612 KB Output is correct
9 Correct 77 ms 2088 KB Output is correct
10 Correct 32 ms 1364 KB Output is correct
11 Correct 37 ms 1512 KB Output is correct
12 Correct 36 ms 1492 KB Output is correct
13 Correct 35 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 856 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 37 ms 1612 KB Output is correct
18 Correct 77 ms 2088 KB Output is correct
19 Correct 32 ms 1364 KB Output is correct
20 Correct 37 ms 1512 KB Output is correct
21 Correct 36 ms 1492 KB Output is correct
22 Correct 35 ms 1364 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 5 ms 892 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 50 ms 2004 KB Output is correct
31 Correct 36 ms 1292 KB Output is correct
32 Correct 30 ms 1236 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 30 ms 1424 KB Output is correct
44 Correct 35 ms 1584 KB Output is correct
45 Correct 45 ms 2496 KB Output is correct
46 Correct 31 ms 1552 KB Output is correct
47 Correct 33 ms 1684 KB Output is correct
48 Correct 33 ms 1600 KB Output is correct
49 Correct 81 ms 3948 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 32 ms 1368 KB Output is correct
53 Correct 32 ms 1492 KB Output is correct
54 Correct 31 ms 1452 KB Output is correct
55 Correct 31 ms 1364 KB Output is correct
56 Correct 29 ms 1364 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 6 ms 996 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 82 ms 4300 KB Output is correct
62 Correct 83 ms 4288 KB Output is correct
63 Correct 1 ms 340 KB Output is correct