oj.uz

답안 #228575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228575 2020-05-01T15:50:28 Z rqi 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 141 ms 4344 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
    bool fst = 1; str res = "{";
    F0R(i,sz(v)) {
        if (!fst) res += ", ";
        fst = 0; res += ts(v[i]);
    }
    res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class T> str ts(T v) {
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

ll B[105][1005];
ll S[105][1005];

ll money[105][105]; //money gained from going from city A to B
ll dist[105][105]; //amount of time
ll eff[105][105];

int main() {
    setIO();
    int N, M, K;
    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++){
            for(int k = 1; k <= K; k++){
                if(B[i][k] == -1 || S[j][k] == -1){
                    continue;
                }
                ckmax(money[i][j], S[j][k]-B[i][k]);
            }
        }
    }

    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            dist[i][j] = INF;
        }
    }

    for(int i = 1; i <= M; i++){
        int V, W;
        ll T;
        cin >> V >> W >> T;
        dist[V][W] = T;
    }

    for(int k = 1; k <= N; k++){
        for(int i = 1; i <= N; i++){
            for(int j = 1; j <= N; j++){
                ckmin(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }

    /*for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            dbg(i, j, money[i][j], dist[i][j]);
        }
    }*/

    ll lo = 0;
    ll hi = 1000000005LL;

    while(lo < hi){
        ll mid = (lo+hi)/2+1;
        bool works = 0;
        for(int i = 1; i <= N; i++){
            for(int j = 1; j <= N; j++){
                eff[i][j] = -INF;
                if(dist[i][j] != INF){
                    ckmax(eff[i][j], money[i][j]-mid*dist[i][j]); 
                }
            }
        }

        for(int k = 1; k <= N; k++){
            for(int i = 1; i <= N; i++){
                for(int j = 1; j <= N; j++){
                    ckmax(eff[i][j], eff[i][k]+eff[k][j]);
                }
            }
        }
        for(int i = 1; i <= N; i++){
            if(eff[i][i] >= 0) works = 1;
        }

        if(mid == 0) works = 1;

        if(works == 1){
            lo = mid;
        }
        else hi = mid-1;
    }

    ps(lo);

    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

merchant.cpp: In function 'void setIn(std::__cxx11::string)':
merchant.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp: In function 'void setOut(std::__cxx11::string)':
merchant.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 2168 KB Output is correct
2 Correct 36 ms 1280 KB Output is correct
3 Correct 37 ms 1280 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 1536 KB Output is correct
2 Correct 141 ms 4088 KB Output is correct
3 Correct 78 ms 1656 KB Output is correct
4 Correct 103 ms 1792 KB Output is correct
5 Correct 100 ms 1792 KB Output is correct
6 Correct 49 ms 1536 KB Output is correct
7 Correct 19 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 19 ms 1024 KB Output is correct
10 Correct 14 ms 1024 KB Output is correct
11 Correct 13 ms 1024 KB Output is correct
12 Correct 10 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 952 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 16 ms 1024 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 11 ms 1024 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 12 ms 1024 KB Output is correct
12 Correct 12 ms 1024 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 12 ms 896 KB Output is correct
15 Correct 13 ms 1024 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 97 ms 1536 KB Output is correct
18 Correct 141 ms 4088 KB Output is correct
19 Correct 78 ms 1656 KB Output is correct
20 Correct 103 ms 1792 KB Output is correct
21 Correct 100 ms 1792 KB Output is correct
22 Correct 49 ms 1536 KB Output is correct
23 Correct 19 ms 896 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 19 ms 1024 KB Output is correct
26 Correct 14 ms 1024 KB Output is correct
27 Correct 13 ms 1024 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 42 ms 1408 KB Output is correct
31 Correct 45 ms 1664 KB Output is correct
32 Correct 64 ms 2688 KB Output is correct
33 Correct 40 ms 1664 KB Output is correct
34 Correct 41 ms 1664 KB Output is correct
35 Correct 41 ms 1664 KB Output is correct
36 Correct 109 ms 4088 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 39 ms 1460 KB Output is correct
40 Correct 42 ms 1536 KB Output is correct
41 Correct 40 ms 1536 KB Output is correct
42 Correct 37 ms 1408 KB Output is correct
43 Correct 38 ms 1408 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 13 ms 1152 KB Output is correct
46 Correct 13 ms 1024 KB Output is correct
47 Correct 12 ms 1024 KB Output is correct
48 Correct 89 ms 4344 KB Output is correct
49 Correct 95 ms 4216 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 69 ms 2168 KB Output is correct
52 Correct 36 ms 1280 KB Output is correct
53 Correct 37 ms 1280 KB Output is correct
54 Correct 10 ms 896 KB Output is correct
55 Correct 10 ms 896 KB Output is correct
56 Correct 10 ms 896 KB Output is correct
57 Correct 10 ms 896 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 10 ms 896 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 10 ms 896 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 10 ms 1024 KB Output is correct