제출 #1126570

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126570		modwwe	스파이 (JOI13_spy)	C++20	100 / 100	165 ms	16452 KiB

spy

#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e18;
const ll mod2 = 998244353;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        //   fin(task);
        //  fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
    // checktime
}
int dp[2001][2001];
int ans[2001];
int in[2001];
int ou[2001];
vector<int> a[2001],b[2001],topo ;
void dfs(int x)
{
    in[x]=++dem;
    for(auto f:a[x])
        dfs(f);
    ou[x]=dem;
}
bool check(int x,int y)
{
    if(in[x]<=in[y]&&in[y]<=ou[x]) return 1;
    return 0;
}
void dfs2(int x)
{
    topo.pb(x);
    for(auto f:b[x])
        dfs2(f);
}
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>l>>r;
        a[l].pb(i);
        b[r].pb(i);
    }
    dfs(0);
    dfs2(0);
    for(int i=1; i<=m; i++)
    {
        cin>>l>>r;
        dp[l][r]++;
    }
    for(auto x:topo)
    {
        for(int j=1; j<=n; j++)
        {
            for(auto f:b[x])
                dp[j][f]+=dp[j][x];
            if(check(j,x))ans[x]+=dp[j][x];
        }
    }
    for(int i=1; i<=n; i++)
        cout<<ans[i],down
    }

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

spy.cpp:36:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   36 | const int inf = 1e18;
      |                 ^~~~
spy.cpp:73:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   73 | main()
      | ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 70 / 70