Submission #3954531

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

vi depths;
vvi nexts;

int depth(int u) {
    if (depths[u] != -1) return depths[u];
    int d = 0;
    for (int v: nexts[u]){
        amax(d, 1+depth(v));
    }
    return depths[u] = d;
}

int solve(int N,int M,vi& x,vi& y) {
    depths.assign(N, -1);
    nexts.resize(N);

    rep(i,M){
        nexts[ x[i] ].pb(y[i]);
    }
    rep(i,N) depth(i);

    return *max_element(ALL(depths));
}

int main() {
    int N, M; scanf("%d%d", &N, &M);
    vi x(M),y(M);
    rep(i,M) {
        scanf("%d%d", &x[i], &y[i]);
        --x[i]; --y[i];
    }
    cout << solve(N,M,x,y) << endl;
    return 0;
}

Submission Info

Submission Time
Task G - Longest Path
User naoya_t
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2856 Byte
Status
Exec Time 34 ms
Memory 8960 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:85:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N, M; scanf("%d%d", &N, &M);
                                    ^
./Main.cpp:88:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x[i], &y[i]);
                                    ^

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18
Case Name Status Exec Time Memory
0_00 1 ms 256 KB
0_01 1 ms 256 KB
0_02 1 ms 256 KB
1_00 1 ms 256 KB
1_01 34 ms 8960 KB
1_02 17 ms 1664 KB
1_03 31 ms 5504 KB
1_04 28 ms 3712 KB
1_05 26 ms 2688 KB
1_06 23 ms 2304 KB
1_07 21 ms 1920 KB
1_08 20 ms 1792 KB
1_09 19 ms 1664 KB
1_10 19 ms 1664 KB
1_11 25 ms 2432 KB
1_12 32 ms 5376 KB
1_13 30 ms 4736 KB
1_14 26 ms 2688 KB
1_15 24 ms 2304 KB
1_16 29 ms 4096 KB
1_17 32 ms 6016 KB
1_18 27 ms 3328 KB