제출 #711349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
711349		ssense	여행하는 상인 (APIO17_merchant)	C++17	0 / 100	16 ms	5068 KiB

merchant

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int n, m, k;
vector<vector<pair<int, int>>> a;
vector<vector<pair<int, int>>> adj;
const int N = 101;
int times[N][N];
int best[N][N];
int best2[N][N];

bool get(int r)
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            best2[i][j] = best[i][j]-r*times[i][j];
        }
        best2[i][i] = -MX;
    }
    for(int bruh = 1; bruh <= n; bruh++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                best2[i][j] = max(best2[i][j], best2[i][bruh] + best2[bruh][j]);
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if(best2[i][i] >= 0)
        {
            return true;
        }
    }
    return false;
}

void solve()
{
    cin >> n >> m >> k;
    a.assign(n+1, vector<pair<int, int>>(k, {-1, -1}));
    for(int i = 0; i <= n; i++)
    {
        for(int j = 0; j <= n; j++)
        {
            times[i][j] = MX;
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j < k; j++)
        {
            cin >> a[i][j].fr >> a[i][j].sc;
        }
    }
    for(int i = 0; i < m; i++)
    {
        times[i+1][i+1] = 0;
        int u, w, t;
        cin >> u >> w >> t;
        times[u][w] = t;
    }
    for(int bruh = 1; bruh <= n; bruh++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                times[i][j] = min(times[i][j], times[i][bruh] + times[bruh][j]);
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            if(times[i][j] != MX)
            {
                for(int bruh = 0; bruh < k; bruh++)
                {
                    if(a[j][bruh].sc != -1 && a[i][bruh].fr != -1)
                    {
                        best[i][j] = max(best[i][j], a[j][bruh].sc-a[i][bruh].fr);
                    }
                }
            }
            else
            {
                best[i][j] = -MX;
            }
        }
    }
    int l = 0, r = 10;
    while(l <= r)
    {
        int mid = l+r>>1;
        if(get(mid))
        {
            l = mid+1;
        }
        else
        {
            r = mid-1;
        }
    }
    cout << r << endl;
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
*/

컴파일 시 표준 에러 (stderr) 메시지

merchant.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
merchant.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
merchant.cpp: In function 'void solve()':
merchant.cpp:118:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  118 |         int mid = l+r>>1;
      |                   ~^~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34