Add editorial and solutions for 2018 contest by Panagiotis Kostopanagiotis

Author: mstou

2018/2018-editorial.pdf

@@ -0,0 +1,47 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+
+#define MAXN 10100
+
+#define X first
+#define Y second
+#define mp make_pair
+#define pb push_back
+
+using namespace std;
+
+int N, M, minim[ MAXN + 1 ], money[ MAXN + 1 ];
+
+typedef pair< int, int > pii;
+typedef pair< pii, pii > payment;
+vector< payment > pays;
+
+int main( void ) {
+    scanf("%d%d", &N, &M );
+    for( int i = 1; i <= M; i++ ) {
+        int p, t1, x1, t2, x2;
+        scanf("%d%d%d%d%d", &p, &x1, &t1, &x2, &t2 );
+        pays.pb( mp( mp( t1, 1 ), mp( x1, p ) ) );
+        pays.pb( mp( mp( t2, -1 ), mp( x2, p ) ) );
+    }
+    sort( pays.begin(), pays.end() );
+    for( int i = 0; i < pays.size(); i++ ) {
+        payment A = pays[ i ];
+        int bank = A.Y.X;
+        int value = A.Y.Y;
+        int kind = A.X.Y;
+        if( kind == 1 ) {
+            money[ bank ] -= value;
+        } else {
+            money[ bank ] += value;
+        }
+        minim[ bank ] = min( minim[ bank ], money[ bank ] );
+    }
+    printf("%d", -minim[ 1 ] );
+    for( int i = 2; i <= N; i++ ) {
+        printf(" %d", -minim[ i ] );
+    }
+    printf("\n");
+    return 0;
+}

2018/problem1/debts.cpp

@@ -0,0 +1,110 @@
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+#include <vector>
+#include <queue>
+
+#define MAXN 155
+#define MAXV 510
+
+#define INF 1234567890.0
+
+#define X first
+#define Y second
+#define mp make_pair
+#define pb push_back
+
+using namespace std;
+
+typedef pair< int, int > pii;
+typedef pair< double, pii > node;
+
+double dist[ MAXN + 1 ][ MAXV + 1 ];
+
+int N, M;
+pii choice[ MAXN + 1 ][ MAXV + 1 ];
+vector< node > G[ MAXN + 1 ];
+
+int readint() {
+    int n = 0;
+    char c = getchar_unlocked();
+    while ( !( '0' <= c && c <= '9' ) ) {
+        c = getchar_unlocked();
+    }
+    while ( '0' <= c && c <= '9' ) {
+        n = n * 10 + c - '0';
+        c = getchar_unlocked();
+    }
+    return n;
+}
+
+void init() {
+    for( int i = 0; i <= MAXN; i++ ) {
+        for( int j = 0; j <= MAXV; j++ ) {
+            dist[ i ][ j ] = INF;
+        }
+    }
+}
+
+void dijkstra( int s ) {
+    init();
+    priority_queue< node, vector<node>, greater<node> > Q;
+    dist[ s ][ 70 ] = 0.0;
+    choice[ s ][ 70 ] = mp( 0, 70 );
+    Q.push( mp( 0, mp( 0, 70 ) ) );
+    while( !Q.empty() ) {
+        node A = Q.top();
+        Q.pop();
+        int u = A.Y.X, vel1 = A.Y.Y;
+        double d = A.X;
+        for( int i = 0; i < G[ u ].size(); i++ ) {
+            int v = G[ u ][ i ].Y.X, vlim = G[ u ][ i ].Y.Y, myvel;
+            double l = G[ u ][ i ].X, ans;
+            if( vlim == 0 ) {
+                myvel = vel1;
+            } else {
+                myvel = vlim;
+            }
+            ans = d + ( double )( ( double )l / ( double )myvel );
+            if( ans < dist[ v ][ myvel ] ) {
+                dist[ v ][ myvel ] = ans;
+                choice[ v ][ myvel ] = mp( u, vel1 );
+                Q.push( mp( ans, mp( v, myvel ) ) );
+            }
+        }
+    }
+}
+
+int main( void ) {
+    int D;
+    scanf("%d%d%d", &N, &M, &D );
+    for( int i = 0; i < M; i++ ) {
+        int a, b, l, v;
+        scanf("%d%d%d%d", &a, &b, &v, &l );
+        G[ a ].pb( mp( ( double )l, mp( b, v ) ) );
+    }
+    dijkstra( 0 );
+    double ans = INF;
+    int vel;
+    for( int i = 0; i <= MAXV; i++ ) {
+        if( dist[ D ][ i ] < ans ) {
+            ans = dist[ D ][ i ];
+            vel = i;
+        }
+    }
+    int t = D;
+    vector< int > path;
+    path.pb( t );
+    while( t > 0 ) {
+        pii u = choice[ t ][ vel ];
+        path.pb( u.X );
+        t = u.X;
+        vel = u.Y;
+    }
+    printf("%d", path[ path.size() - 1 ] );
+    for( int i = path.size() - 2; i >= 0; i-- ) {
+        printf(" %d", path[ i ] );
+    }
+    printf("\n");
+    return 0;
+}