oj.uz

Submission #270803

# Submission time Handle Problem Language Result Execution time Memory
270803 2020-08-18T02:16:22 Z NaimSS Travelling Merchant (APIO17_merchant) C++14
100 / 100
 104 ms 2228 KB 
    #include <bits/stdc++.h>
    #define ld long double
    #define endl "\n"
    #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #define pb(x) push_back(x)
    #define mp(a,b) make_pair(a,b)
    #define ms(v,x) memset(v,x,sizeof(v))
    #define all(v) v.begin(),v.end()
    #define ff first
    #define ss second
    #define rep(i, a, b) for(int i = a; i < (b); ++i)
    #define per(i, a, b) for(int i = b-1; i>=a ; i--)
    #define trav(a, x) for(auto& a : x)
    #define allin(a , x) for(auto a : x)
    #define td(v) v.begin(),v.end()
    #define sz(v) (int)v.size()
    //#define int long long
    using namespace std;
    typedef vector<int> vi;
    #define y1 abacaba
    #define left sefude
    #define db(x) cerr << #x <<" == "<<x << endl;
    #define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
    #define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
    typedef long long ll;
    typedef pair<ll,ll> pll;
    typedef pair<int,int> pii;
    inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
    ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
    ll exp(ll a,ll b,ll m){
        if(b==0LL) return 1LL;
        if(b==1LL) return mod(a,m);
        ll k = mod(exp(a,b/2,m),m);
        if(b&1LL){
            return mod(a*mod(k*k,m),m);
        }
        else return mod(k*k,m);
    }
     
    const int N = 105;
    const int K = 1010;
    ll S[N][K],B[N][K];
    const ll inf = 1e9 + 2;
    ll dist[N][N];
    ll dp[N][N];
    ll best[N][N];
    int n,m,k;
    const ll inf2 = 1e18;
    bool ok(ll x){
      
      for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
          if(dist[i][j]!=inf2){
            dp[i][j] = dist[i][j] * x - best[i][j];
          }else dp[i][j] = inf2;
        }
      }
      for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
          for(int j=1;j<=n;j++){
            dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j]);
          }
        }
      }
      for(int i=1;i<=n;i++){
        if(dp[i][i]<=0)return 1;
      }
      return 0;
    }
     
    int32_t main(){
      fastio;
      cin >> n >> m >> k;
      for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
          cin >> B[i][j] >> S[i][j];
        }
      }
      for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
          dist[i][j] = inf2;
          best[i][j] = 0;
          for(int s=1;s<=k;s++){
            if(B[i][s]!=-1 and S[j][s]!=-1){
              best[i][j] = max(best[i][j],S[j][s] - B[i][s]);
            }
          }
        }
      }
     
      for(int i=0;i<m;i++){
        int a,b,c;
        cin >> a >> b >> c;
        dist[a][b] = c;
      }
      
      //dist[1][1] = inf;
      
      for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
          for(int j=1;j<=n;j++){
            dist[i][j] = min(dist[i][j],dist[i][k] + dist[k][j]);
          }
        }
      }
      
     
      int l = 0, r = 1e9;
      int ans = 0;
      
      while(l<=r){
        int mid = (l + r)/2;
        if(ok(mid)){
          ans = mid;
          l = mid + 1;
        }else r = mid - 1;
      }
     
      cout << ans << endl;
     
      // math -> gcd it all
      // Did u check N=1? Did you switch N,M?
    }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 2168 KB Output is correct
2 Correct 40 ms 1408 KB Output is correct
3 Correct 38 ms 1408 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 6 ms 928 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 6 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 7 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1612 KB Output is correct
2 Correct 104 ms 2168 KB Output is correct
3 Correct 49 ms 1408 KB Output is correct
4 Correct 45 ms 1536 KB Output is correct
5 Correct 45 ms 1536 KB Output is correct
6 Correct 45 ms 1408 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 7 ms 956 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 896 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 7 ms 896 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 44 ms 1612 KB Output is correct
18 Correct 104 ms 2168 KB Output is correct
19 Correct 49 ms 1408 KB Output is correct
20 Correct 45 ms 1536 KB Output is correct
21 Correct 45 ms 1536 KB Output is correct
22 Correct 45 ms 1408 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 7 ms 956 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 72 ms 1408 KB Output is correct
31 Correct 61 ms 1536 KB Output is correct
32 Correct 60 ms 2172 KB Output is correct
33 Correct 41 ms 1536 KB Output is correct
34 Correct 45 ms 1536 KB Output is correct
35 Correct 50 ms 1536 KB Output is correct
36 Correct 97 ms 2228 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 39 ms 1408 KB Output is correct
40 Correct 41 ms 1536 KB Output is correct
41 Correct 42 ms 1520 KB Output is correct
42 Correct 40 ms 1408 KB Output is correct
43 Correct 39 ms 1408 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 10 ms 896 KB Output is correct
46 Correct 8 ms 896 KB Output is correct
47 Correct 8 ms 896 KB Output is correct
48 Correct 102 ms 2168 KB Output is correct
49 Correct 101 ms 2168 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 67 ms 2168 KB Output is correct
52 Correct 40 ms 1408 KB Output is correct
53 Correct 38 ms 1408 KB Output is correct
54 Correct 6 ms 896 KB Output is correct
55 Correct 6 ms 896 KB Output is correct
56 Correct 6 ms 896 KB Output is correct
57 Correct 7 ms 896 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 6 ms 928 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 6 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 7 ms 896 KB Output is correct