Submission #44218

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
44218	2018-03-30T14:55:35 Z	imaxblue	Programming Contest (POI11_pro)	C++17	100 / 100	993 ms	12716 KB

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846

ll ans, c;
int n, m, k, t, e, a, b, N, D, P;
int adj[1005][1005], cost[1005][1005], p[1005];
pq<p3i> q;
bool u[1005];
void path(int N){
    if (p[N]==-1) return;
    adj[p[N]][N]--;
    adj[N][p[N]]++;
    if (cost[p[N]][N]) cost[p[N]][N]++;
    path(p[N]);
}
bool get_path(){
    while(q.size()) q.pop();
    drain(u);
    q.push(mp(mp(0, 0), -1));
    while(q.size()){
        N=q.top().x.y; D=-q.top().x.x; P=q.top().y; q.pop();
        if (u[N]) continue;
        u[N]=1; p[N]=P;
        if (N==1004){
            path(N);
            //cout << "*" << D << endl;
            c+=D; ans++;
            return 1;
        }
        fox(l, 1005){
            if (adj[N][l]){
                q.push(mp(mp(-D-cost[N][l], l), N));
            }
        }
    }
    return 0;
}
int main(){
    scanf("%i%i%i%i%i", &n, &m, &k, &t, &e);
    fox1(l, n){
        adj[0][l]=t/k;
        cost[0][l]=1;
    }
    fox1(l, m){
        adj[l+n][1004]=1;
    }
    fox(l, e){
        scanf("%i%i", &a, &b);
        adj[a][b+n]=1;
    }
    /*fox(l, n+1){
        fox(l2, 10){
            cout << adj[l][l2] << ' ';
        } cout << endl;
    }*/
    while(get_path());
    //cout << c << ' ' << k << endl;
    printf("%lli %lli\n", ans, c*k);
    fox1(l, n){
        int x=0;
        fox1(l2, m){
            if (adj[l2+n][l]){
                printf("%i %i %i\n", l, l2, x*k);
                x++;
            }
        }
    }
    return 0;
}

Compilation message

pro.cpp: In function 'int main()':
pro.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i%i%i%i", &n, &m, &k, &t, &e);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pro.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	888 KB	Output is correct
2	Correct	7 ms	1012 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1212 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	1324 KB	Output is correct
2	Correct	2 ms	1324 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	48 ms	2412 KB	Output is correct
2	Correct	26 ms	2584 KB	Output is correct
3	Correct	4 ms	2584 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	186 ms	4764 KB	Output is correct
2	Correct	182 ms	5380 KB	Output is correct
3	Correct	4 ms	5380 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	130 ms	7024 KB	Output is correct
2	Correct	993 ms	7188 KB	Output is correct
3	Correct	17 ms	7188 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	424 ms	8176 KB	Output is correct
2	Correct	90 ms	8432 KB	Output is correct
3	Correct	15 ms	8432 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	386 ms	8788 KB	Output is correct
2	Correct	22 ms	9176 KB	Output is correct
3	Correct	163 ms	9864 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	128 ms	10656 KB	Output is correct
2	Correct	5 ms	10656 KB	Output is correct
3	Correct	13 ms	10656 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	659 ms	10864 KB	Output is correct
2	Correct	259 ms	12660 KB	Output is correct
3	Correct	22 ms	12716 KB	Output is correct