Submission #580159

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
580159	2022-06-20T16:25:07 Z	MohammadAghil	Travelling Merchant (APIO17_merchant)	C++17	100 / 100	93 ms	4200 KB

merchant

      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1e2 + 5, maxk = 1e3 + 5, lg = 22, inf = ll(1e18) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

ll adj[maxn][maxn], adj2[maxn][maxn], s[maxn][maxk], b[maxn][maxk], prof[maxn][maxn];
int n;

void feloyd(ll adj[maxn][maxn]){
     rep(k,0,n) rep(i,0,n) rep(j,0,n) adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
}

int main(){
     cin.tie(0) -> sync_with_stdio(0);
     int m, k; cin >> n >> m >> k;
     rep(i,0,n){
          rep(j,0,k) cin >> b[i][j] >> s[i][j];
     }
     rep(i,0,n) rep(j,0,n) adj[i][j] = inf;
     rep(i,0,m){
          int u, v, w; cin >> u >> v >> w; u--, v--;
          adj[u][v] = w;
     }
     feloyd(adj);
     rep(i,0,n) rep(j,0,n) rep(t,0,k) if(s[j][t] + 1 && b[i][t] + 1) prof[i][j] = max(prof[i][j], s[j][t] - b[i][t]);
     ll l = 0, r = ll(1e9) + 5;
     while(l + 1 < r){
          ll mid = (l + r)>>1ll;
          rep(i,0,n) rep(j,0,n) {
               if(adj[i][j] == inf) adj2[i][j] = inf;
               else adj2[i][j] = mid*adj[i][j] - prof[i][j];
          }
          feloyd(adj2);
          bool ok = false;
          rep(i,0,n) if(adj2[i][i] <= 0) ok = true;
          (ok?l:r) = mid; 
     }
     cout << l << '\n';
     return 0; 
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	2008 KB	Output is correct
2	Correct	31 ms	1236 KB	Output is correct
3	Correct	39 ms	1236 KB	Output is correct
4	Correct	5 ms	820 KB	Output is correct
5	Correct	5 ms	724 KB	Output is correct
6	Correct	5 ms	724 KB	Output is correct
7	Correct	5 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	820 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	5 ms	852 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	724 KB	Output is correct
2	Correct	5 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	820 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	5 ms	852 KB	Output is correct
9	Correct	7 ms	852 KB	Output is correct
10	Correct	6 ms	848 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	340 KB	Output is correct
15	Correct	5 ms	852 KB	Output is correct
16	Correct	5 ms	916 KB	Output is correct
17	Correct	6 ms	852 KB	Output is correct
18	Correct	6 ms	852 KB	Output is correct
19	Correct	6 ms	944 KB	Output is correct
20	Correct	6 ms	852 KB	Output is correct
21	Correct	6 ms	852 KB	Output is correct
22	Correct	7 ms	852 KB	Output is correct
23	Correct	6 ms	852 KB	Output is correct
24	Correct	5 ms	852 KB	Output is correct
25	Correct	6 ms	896 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	6 ms	896 KB	Output is correct
28	Correct	7 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	896 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	6 ms	896 KB	Output is correct
4	Correct	7 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	38 ms	1416 KB	Output is correct
9	Correct	80 ms	2128 KB	Output is correct
10	Correct	34 ms	1364 KB	Output is correct
11	Correct	43 ms	1492 KB	Output is correct
12	Correct	38 ms	1520 KB	Output is correct
13	Correct	47 ms	1420 KB	Output is correct

Subtask #4
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	852 KB	Output is correct
2	Correct	6 ms	848 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	340 KB	Output is correct
7	Correct	5 ms	852 KB	Output is correct
8	Correct	5 ms	916 KB	Output is correct
9	Correct	6 ms	852 KB	Output is correct
10	Correct	6 ms	852 KB	Output is correct
11	Correct	6 ms	944 KB	Output is correct
12	Correct	6 ms	852 KB	Output is correct
13	Correct	6 ms	852 KB	Output is correct
14	Correct	7 ms	852 KB	Output is correct
15	Correct	6 ms	852 KB	Output is correct
16	Correct	5 ms	852 KB	Output is correct
17	Correct	38 ms	1416 KB	Output is correct
18	Correct	80 ms	2128 KB	Output is correct
19	Correct	34 ms	1364 KB	Output is correct
20	Correct	43 ms	1492 KB	Output is correct
21	Correct	38 ms	1520 KB	Output is correct
22	Correct	47 ms	1420 KB	Output is correct
23	Correct	6 ms	896 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	6 ms	896 KB	Output is correct
26	Correct	7 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	51 ms	2008 KB	Output is correct
31	Correct	31 ms	1236 KB	Output is correct
32	Correct	39 ms	1236 KB	Output is correct
33	Correct	5 ms	820 KB	Output is correct
34	Correct	5 ms	724 KB	Output is correct
35	Correct	5 ms	724 KB	Output is correct
36	Correct	5 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	820 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	5 ms	852 KB	Output is correct
43	Correct	32 ms	1364 KB	Output is correct
44	Correct	35 ms	1492 KB	Output is correct
45	Correct	58 ms	2624 KB	Output is correct
46	Correct	35 ms	1492 KB	Output is correct
47	Correct	33 ms	1576 KB	Output is correct
48	Correct	35 ms	1492 KB	Output is correct
49	Correct	87 ms	3996 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	1364 KB	Output is correct
53	Correct	36 ms	1364 KB	Output is correct
54	Correct	33 ms	1364 KB	Output is correct
55	Correct	37 ms	1364 KB	Output is correct
56	Correct	42 ms	1240 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	8 ms	980 KB	Output is correct
59	Correct	7 ms	980 KB	Output is correct
60	Correct	7 ms	956 KB	Output is correct
61	Correct	90 ms	4184 KB	Output is correct
62	Correct	93 ms	4200 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct

Submission #580159

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 21.0 / 21.0

Subtask #3 33.0 / 33.0

Subtask #4 34.0 / 34.0

Subtask #1
12.0 / 12.0

Subtask #2
21.0 / 21.0

Subtask #3
33.0 / 33.0

Subtask #4
34.0 / 34.0