oj.uz

답안 #335424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335424 2020-12-12T15:28:28 Z ec1117 Toll (BOI17_toll) C++17
100 / 100
 243 ms 28396 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<pi, int> pii;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
template<class T> using V = vector<T>; 
template<class T, size_t SZ> using AR = array<T,SZ>; 

#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 sor(x) sort(all(x)) 
#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 For(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 Rof(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

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; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
        // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
        hi ++; assert(lo <= hi); // assuming f is increasing
        while (lo < hi) { // find first index such that f is true 
                T mid = half(lo+hi);
                f(mid) ? hi = mid : lo = mid+1; 
        } 
        return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
        lo --; assert(lo <= hi); // assuming f is decreasing
        while (lo < hi) { // find first index such that f is true 
                T mid = half(lo+hi+1);
                f(mid) ? lo = mid : hi = mid-1;
        } 
        return lo;
}
template<class T> void remDup(vector<T>& v) { 
        sort(all(v)); v.erase(unique(all(v)),end(v)); }

// 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
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
        #ifdef LOCAL
                return b ? "true" : "false"; 
        #else 
                return ts((int)b);
        #endif
}
template<class A> str ts(complex<A> c) { 
        stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
        str res = "{"; F0R(i,sz(v)) res += char('0'+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 A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
        #ifdef LOCAL
                bool fst = 1; str res = "{";
                for (const auto& x: v) {
                        if (!fst) res += ", ";
                        fst = 0; res += ts(x);
                }
                res += "}"; return res;
        #else
                bool fst = 1; str res = "";
                for (const auto& x: v) {
                        if (!fst) res += " ";
                        fst = 0; res += ts(x);
                }
                return res;

        #endif
}
template<class A, class B> str ts(pair<A,B> p) {
        #ifdef LOCAL
                return "("+ts(p.f)+", "+ts(p.s)+")"; 
        #else
                return ts(p.f)+" "+ts(p.s);
        #endif
}

// 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 << ts(h); if (sizeof...(t)) cerr << ", ";
        DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
        #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
        #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
                 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
        #define dbg(...) 0
        #define chk(...) 0
#endif

int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}
int max(int a,int b, int c){return max(a,max(b,c));}
int min(int a,int b, int c){return min(a,min(b,c));}
ll max(ll a,ll b, ll c){return max(a,max(b,c));}
ll min(ll a,ll b, ll c){return min(a,min(b,c));}
void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str 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
}
// 576743 29995400689069LL
const int MOD = 1e9+7; // 998244353;
const int MX = 5e4+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};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());

int adj[MX][21][6];
//go 2^i groups 

void solve(){
    int k,n,m,o;re(k,n,m,o);
    For(i,n)For(j,k)For(l,20)adj[i][l][j]=MOD;
    For(i,m){
        int x,y,t;re(x,y,t);
        ckmin(adj[x][0][y%k],t);
        //guaranteed paths of len 1
    }
    FOR(i,1,20){
        For(j,n){
            For(z,k){
                For(y,k){
                    if(adj[j][i-1][y]==MOD || k*(j/k+(1<<(i-1)))+y>=n || adj[k*(j/k+(1<<(i-1)))+y][i-1][z]==MOD)
                        continue;
                    else{
                        ckmin(adj[j][i][z],adj[j][i-1][y]+adj[k*(j/k+(1<<(i-1)))+y][i-1][z]);
                    }
                }
            }
        }
    }
    For(i,o){
        int x,y;re(x,y);
        int d=y/k-x/k;
        if(d==0){
            ps(-1);
            continue;
        }
        vl mn(5,MOD);
        mn[x%k]=0;
        x=x/k*k;
        For(j,20)if(d & (1<<j)){
            vl mn2(5,MOD);
            For(l,k)if(mn[l]!=MOD){
                For(r,k){
                    if(adj[x+l][j][r]!=MOD)
                        ckmin(mn2[r],mn[l]+adj[x+l][j][r]);
                }
            }
            mn=mn2;
            x=k*(x/k+(1<<j));
        }
        ps(mn[y%k]==MOD?-1:mn[y%k]);
    }
}

int main() {
        setIO();
        int t=1;
        // re(t);
        while(t--)solve();
        // 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
        * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

toll.cpp: In function 'void dbga(int*, int)':
toll.cpp:162:26: warning: statement has no effect [-Wunused-value]
  162 |         #define dbg(...) 0
      |                          ^
toll.cpp:171:55: note: in expansion of macro 'dbg'
  171 | void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
      |                                                       ^~~
toll.cpp: In function 'void dbga(ll*, int)':
toll.cpp:162:26: warning: statement has no effect [-Wunused-value]
  162 |         #define dbg(...) 0
      |                          ^
toll.cpp:172:54: note: in expansion of macro 'dbg'
  172 | void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
      |                                                      ^~~
toll.cpp: In function 'void setIn(str)':
toll.cpp:175:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  175 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
toll.cpp: In function 'void setOut(str)':
toll.cpp:176:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  176 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 25068 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 60 ms 25964 KB Output is correct
9 Correct 54 ms 25964 KB Output is correct
10 Correct 32 ms 25196 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 25068 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 8 ms 1004 KB Output is correct
9 Correct 53 ms 25964 KB Output is correct
10 Correct 162 ms 27372 KB Output is correct
11 Correct 98 ms 26860 KB Output is correct
12 Correct 119 ms 26348 KB Output is correct
13 Correct 182 ms 17772 KB Output is correct
14 Correct 89 ms 16620 KB Output is correct
15 Correct 146 ms 16364 KB Output is correct
16 Correct 141 ms 16384 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 4 ms 876 KB Output is correct
9 Correct 3 ms 876 KB Output is correct
10 Correct 47 ms 25812 KB Output is correct
11 Correct 85 ms 26604 KB Output is correct
12 Correct 155 ms 27116 KB Output is correct
13 Correct 155 ms 27392 KB Output is correct
14 Correct 150 ms 26860 KB Output is correct
15 Correct 139 ms 16364 KB Output is correct
16 Correct 139 ms 16364 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 4 ms 876 KB Output is correct
9 Correct 3 ms 876 KB Output is correct
10 Correct 47 ms 25812 KB Output is correct
11 Correct 85 ms 26604 KB Output is correct
12 Correct 155 ms 27116 KB Output is correct
13 Correct 155 ms 27392 KB Output is correct
14 Correct 150 ms 26860 KB Output is correct
15 Correct 139 ms 16364 KB Output is correct
16 Correct 139 ms 16364 KB Output is correct
17 Correct 90 ms 26604 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 4 ms 876 KB Output is correct
24 Correct 4 ms 876 KB Output is correct
25 Correct 6 ms 1004 KB Output is correct
26 Correct 5 ms 1004 KB Output is correct
27 Correct 50 ms 25836 KB Output is correct
28 Correct 157 ms 27372 KB Output is correct
29 Correct 162 ms 27520 KB Output is correct
30 Correct 146 ms 26860 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 25068 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 60 ms 25964 KB Output is correct
9 Correct 54 ms 25964 KB Output is correct
10 Correct 32 ms 25196 KB Output is correct
11 Correct 90 ms 25068 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 7 ms 1004 KB Output is correct
18 Correct 8 ms 1004 KB Output is correct
19 Correct 53 ms 25964 KB Output is correct
20 Correct 162 ms 27372 KB Output is correct
21 Correct 98 ms 26860 KB Output is correct
22 Correct 119 ms 26348 KB Output is correct
23 Correct 182 ms 17772 KB Output is correct
24 Correct 89 ms 16620 KB Output is correct
25 Correct 146 ms 16364 KB Output is correct
26 Correct 141 ms 16384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 2 ms 876 KB Output is correct
34 Correct 4 ms 876 KB Output is correct
35 Correct 3 ms 876 KB Output is correct
36 Correct 47 ms 25812 KB Output is correct
37 Correct 85 ms 26604 KB Output is correct
38 Correct 155 ms 27116 KB Output is correct
39 Correct 155 ms 27392 KB Output is correct
40 Correct 150 ms 26860 KB Output is correct
41 Correct 139 ms 16364 KB Output is correct
42 Correct 139 ms 16364 KB Output is correct
43 Correct 90 ms 26604 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 4 ms 876 KB Output is correct
50 Correct 4 ms 876 KB Output is correct
51 Correct 6 ms 1004 KB Output is correct
52 Correct 5 ms 1004 KB Output is correct
53 Correct 50 ms 25836 KB Output is correct
54 Correct 157 ms 27372 KB Output is correct
55 Correct 162 ms 27520 KB Output is correct
56 Correct 146 ms 26860 KB Output is correct
57 Correct 243 ms 28396 KB Output is correct
58 Correct 58 ms 25964 KB Output is correct
59 Correct 103 ms 26860 KB Output is correct