제출 #1241998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241998		sitingfake	Bitaro’s Party (JOI18_bitaro)	C++20	100 / 100	936 ms	211324 KiB

bitaro

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

// define

#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ld double
#define ii pair<int,int>
#define se second
#define fi first
#define iii pair<int,ii>
#define all(v) v.begin(),v.end()
#define bit(x,i) (((x)>>(i))&1LL)
#define flip(x,i) ((x)^(1LL<<(i)))
#define ms(d,x) memset(d,x,sizeof(d))
#define sitingfake 1
#define orz 1
#define exist __exist
#define ends __ends
#define visit visited
#define left __left
#define right __right

//constant

const ll mod = 1e9 + 7;
const long long linf = 4557430888798830399;
const int inf = 1061109567;
const int maxarr = 1e6 + 5;
int dx[] = {0 , -1 , 0 , 1};
int dy[] = {-1 , 0 , 1 , 0};

template<typename T> bool maximize(T &a, const T &b)
{
    if(a < b) {a = b; return 1;}
    return 0;
}

template<typename T> bool minimize(T &a, const T &b)
{
    if(a > b) {a = b; return 1;}
    return 0;
}

inline void Plus(ll & a ,ll b)
{
    b %= mod;
    a += b;
    if(a >= mod) a -= mod;
    if(a < 0) a += mod;
    return;
}

inline void Mul(ll & a, ll b)
{
    a %= mod; b %= mod;
    a *= b;
    a %= mod;
    return;
}

//code

const int maxn = 1e5 + 7;

int n , Lim , q;

int m;

vector <int> a[maxn];

bool blocked[maxn];

vector <ii> path[maxn];

int dist[maxn] , dp[maxn];

void solve(void)
{
    cin >> n >> m >> q;

    Lim = min(150 , (int)sqrt(n) + 1);

    for(int i = 1; i <= m; i++)
    {
        int u , v;
        cin >> u >> v;
        a[v].push_back(u);
    }

    ms(dist , -1);

    for(int i = 1; i <= n; i++)
    {
        path[i].push_back(ii(0 , i));

        vector <int> tmp;

        for(int v : a[i])
        {
            for(ii it : path[v])
            {
                if(dist[it.se] == -1)
                {
                    dist[it.se] = it.fi + 1;
                    tmp.push_back(it.se);
                }
                else
                {
                    maximize(dist[it.se] , it.fi + 1);
                }
            }
        }

        for(int it : tmp)
        {
            path[i].push_back(ii(dist[it] , it));
            dist[it] = -1;
        }

        sort(all(path[i]) , greater <ii> ());

        while(path[i].size() > Lim) path[i].pop_back();
    }

    while(q--)
    {
        int pos , numBlocks;

        vector <int> p;

        cin >> pos >> numBlocks;

        for(int i = 1; i <= numBlocks; i++)
        {
            int x;
            cin >> x;
            p.push_back(x);
            blocked[x] = 1;
        }

        if(numBlocks >= Lim)
        {
            ms(dp , -0x3f);

            dp[pos] = 0;
            int ans = -1;

            for(int i = pos; i >= 1; i--)
            {
                if(dp[i] == -inf) continue;

                if(!blocked[i]) maximize(ans , dp[i]);

                for(int v : a[i])
                {
                    maximize(dp[v] , dp[i] + 1);
                }
            }

            cout << ans << "\n";
        }
        else
        {
            int ans = -1;

            for(ii it : path[pos])
            {
                if(!blocked[it.se])
                {
                    ans = it.fi;
                    break;
                }
            }

            cout << ans << "\n";
        }

        for(int x : p) blocked[x] = 0;
    }
}
/**
**/
signed main()
{
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0);

   #define task ""

   if(fopen(task".inp","r"))
   {
       freopen(task".inp","r",stdin);
       freopen(task".out","w",stdout);
   }

   int tc; tc = 1;

   while(tc--) solve();

   //execute;
}

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

bitaro.cpp: In function 'int main()':
bitaro.cpp:195:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  195 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:196:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  196 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 86 / 86