제출 #161653

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
161653	2019-11-03 12:53:41	amoo_safar	File Paths (BOI15_fil)	C++14	100 / 100	934 ms	19848 KiB

fil

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
    #include <bits/stdc++.h>
     
    #define pb push_back
    #define F first
    #define S second
    #define all(x) x.begin(), x.end()
     
    using namespace std;
     
    typedef int ll;
    typedef long double ld;
    typedef string str;
    typedef pair<ll, ll> pll;
     
    const ll Mod = 1e9 + 7;
    const int Maxn = 3e3 + 10;
    const ll Inf = 1000000000000000LL;
     
    vector<pll> G[Maxn];
    vector<pll> Q[Maxn];
    vector<ll> R[Maxn];
    bool ans[Maxn];
    ll dep[Maxn];
     
    map<ll, ll> mp;
     
    void DFS(ll u, ll d = 0){
      dep[u] = d;
      R[u].pb(0);
      mp[d] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

fil.cpp:17:20: warning: overflow in implicit constant conversion [-Woverflow]
     const ll Inf = 1000000000000000LL;
                    ^~~~~~~~~~~~~~~~~~

• Subtask 1: 33 / 33
• Subtask 2: 33 / 33
• Subtask 3: 34 / 34