Submission #98952

# Submission time Handle Problem Language Result Execution time Memory
98952 2019-02-27T17:26:50 Z kjain_1810 Shell (info1cup18_shell) C++17
75 / 100
279 ms 12664 KB
// #include <bits/stdc++.h>
#include<cstdio>
#include<vector>
#define pb push_back
// #define f first
// #define s second
// #define ind(a) scanf("%d", &a)
#define inlld(a) scanf("%lld", &a)
// #define ind2(a, b) scanf("%d%d", &a, &b)
#define inlld2(a, b) scanf("%lld%lld", &a, &b)
// #define ind3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define inlld3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)

using namespace std;

const int N=1505;
const int MOD=1e9+7;

typedef long long ll;
// typedef long double ld;

ll n, m, p, tovis[N], visord[N];
vector<ll>adj[N];
ll vis[N], nex[N], dp[N];

void dfs(ll u)
{
    vis[u]=1;
    if(visord[u]>0)
        nex[u]=visord[u];
    else
        nex[u]=MOD;
    for(ll a=0; a<adj[u].size(); a++)
    {
        ll v=adj[u][a];
        if(!vis[v])
            dfs(v);
        nex[u]=min(nex[u], nex[v]);
    }
}

void dfs2(ll u)
{
    vis[u]=1;
    if(u==tovis[p])
    {
        dp[u]=1;
        return;
    }
    ll chk=(nex[u]==u?tovis[visord[u]+1]:nex[u]);
    for(ll a=0; a<adj[u].size(); a++)
    {
        ll v=adj[u][a];
        if(!vis[v])
            dfs2(v);
        if(nex[v]==chk)
            dp[u]=(dp[u]+dp[v])%MOD;
    }
    // printf("%lld %lld\n", u, dp[u]);
}

int main() 
{
    inlld3(n, m, p);
    for(ll a=1; a<=p; a++)
        inlld(tovis[a]);
    if(tovis[1]!=1)
    {
        for(ll a=p+1; a>=2; a--)
            tovis[a]=tovis[a-1];
        tovis[1]=1;
        p++;
    }
    if(tovis[p]!=n)
        tovis[++p]=n;
    for(ll a=1; a<=p; a++)
        visord[tovis[a]]=a;
    while(m--)
    {
        ll u, v;
        inlld2(u, v);
        adj[u].pb(v);
    }
    for(ll a=1; a<=n; a++)
        if(!vis[a])
            dfs(a);
    for(ll a=1; a<=n; a++)
    {
        vis[a]=0;
        if(nex[a]<MOD)
            nex[a]=tovis[nex[a]];
    }
    for(ll a=1; a<=n; a++)
        if(!vis[a])
            dfs2(a);
    printf("%lld\n", dp[1]);
    return 0;
}

Compilation message

shell.cpp: In function 'void dfs(ll)':
shell.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll a=0; a<adj[u].size(); a++)
                 ~^~~~~~~~~~~~~~
shell.cpp: In function 'void dfs2(ll)':
shell.cpp:51:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll a=0; a<adj[u].size(); a++)
                 ~^~~~~~~~~~~~~~
shell.cpp: In function 'int main()':
shell.cpp:12:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define inlld3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
shell.cpp:64:5: note: in expansion of macro 'inlld3'
     inlld3(n, m, p);
     ^~~~~~
shell.cpp:8:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define inlld(a) scanf("%lld", &a)
                  ~~~~~^~~~~~~~~~~~
shell.cpp:66:9: note: in expansion of macro 'inlld'
         inlld(tovis[a]);
         ^~~~~
shell.cpp:10:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define inlld2(a, b) scanf("%lld%lld", &a, &b)
                      ~~~~~^~~~~~~~~~~~~~~~~~~~
shell.cpp:81:9: note: in expansion of macro 'inlld2'
         inlld2(u, v);
         ^~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 13 ms 768 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 99 ms 5668 KB Output is correct
3 Correct 104 ms 5752 KB Output is correct
4 Correct 141 ms 5772 KB Output is correct
5 Correct 62 ms 4156 KB Output is correct
6 Correct 279 ms 12660 KB Output is correct
7 Correct 200 ms 12664 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 13 ms 768 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 99 ms 5668 KB Output is correct
13 Correct 104 ms 5752 KB Output is correct
14 Correct 141 ms 5772 KB Output is correct
15 Correct 62 ms 4156 KB Output is correct
16 Correct 279 ms 12660 KB Output is correct
17 Correct 200 ms 12664 KB Output is correct
18 Execution timed out 3 ms 384 KB Time limit exceeded (wall clock)
19 Halted 0 ms 0 KB -