oj.uz

Submission #243742

# Submission time Handle Problem Language Result Execution time Memory
243742 2020-07-01T18:04:05 Z AmineWeslati Journey (NOI18_journey) C++14
100 / 100
 72 ms 33376 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int lim=5e8+1;
int dp[10000][401];

int add(int x, int y){
   if(x+y>lim) return lim;
   else return x+y;
}

int32_t main(){
   boost;
   int V,M,E; cin>>V>>M>>E;
   for(int i=0; i<V; i++) for(int j=0; j<M; j++) dp[i][j]=0;
   dp[0][0]=1;
   
   for(int u=0; u<V-1; u++) for(int j=0; j<E; j++){
      int v,w; cin>>v>>w;
      if(v<=u) continue;
      int s=0;
      for(int x=w; x<M; x++){
         s=add(s,dp[u][x-w]);
         dp[v][x]=add(dp[v][x],s);
      }
   }
   for(int i=0; i<M; i++) cout << dp[V-1][i] << ' ';

   return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 68 ms 33376 KB Output is correct
8 Correct 61 ms 20368 KB Output is correct
9 Correct 16 ms 2944 KB Output is correct
10 Correct 72 ms 3368 KB Output is correct