제출 #1007809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007809		n3rm1n	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	978 ms	524288 KiB

bitaro

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
const long long MAXN = 2e5 + 10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
long long n, m, q;
vector < long long > g[MAXN], grev[MAXN];
long long tt, yy;
void read()
{
    cin >> n >> m >> q;
    long long from, to;
    for (long long i = 1; i <= m; ++ i)
    {
        cin >> from >> to;
        g[from].push_back(to);
        grev[to].push_back(from);
    }
}


long long marked[MAXN], dp[MAXN];
deque < pair < long long, long long > > opt[MAXN];
long long c[MAXN], f[MAXN];

deque < pair < long long, long long > > comb(deque < pair < long long, long long > > f, deque < pair < long long, long long > > s)
{
    deque < pair < long long, long long > > q;
    while(f.size() && s.size() && q.size() < sqrt(n))
    {
        pair <long long, long long >  ft = f.front();
        pair < long long, long long > st = s.front();
        st.first ++;
        if(ft.first > st.first)
        {
            f.pop_front();
            if(!q.size())q.push_back(ft);
            else if(q.size() && ft != q.front())q.push_back(ft);
        }
        else
        {
            s.pop_front();

           if(!q.size())q.push_back(st);
            else if(q.size() && st != q.front())q.push_back(st);
        }
    }
    while(f.size() && q.size() < sqrt(n))
    {
        pair <long long, long long >  ft = f.front();
            f.pop_front();
            if(!q.size())q.push_back(ft);
            else if(q.size() && ft != q.front())q.push_back(ft);
    }
    while(s.size() && q.size() < sqrt(n))
    {
        pair <long long, long long >  st = s.front();
        st.first ++;
            s.pop_front();
          if(!q.size())q.push_back(st);
            else if(q.size() && st != q.front())q.push_back(st);
    }
    return q;
}
void precompute_small()
{
    opt[1].push_back(make_pair(0, 1));
    for (long long i = 2; i <= n; ++ i)
    {
        long long apar;
        deque < pair < long long, long long > > qq;
        qq.push_back(make_pair(0, i));
        opt[i] = qq;
        for (long long j = 0; j < grev[i].size(); ++ j)
        {
            apar = grev[i][j];
            opt[i] = comb(opt[i], opt[apar]);
        }
    }

    /*for (long long i =1;i <= n; ++ i)
    {
        cout << "for i " << i << endl;
        for (long long j = 0; j < opt[i].size(); ++ j)
            cout << " (" <<opt[i][j].first << "," << opt[i][j].second <<") ";
        cout <<endl;
    }*/
}
void solve_small()
{
    //cout << "is small" << endl;
    long long maxx = -1;
    for (long long i = 0; i < opt[tt].size(); ++ i)
    {
        if(!marked[opt[tt][i].second])
            maxx = max(maxx, opt[tt][i].first);
    }

    cout << maxx << endl;
}
void solve_big()
{
    //cout << "is big" << endl;
    for (long long i = 1; i <= n; ++ i)
        dp[i] = -1;
    long long maxx = -1, cnt = 0;
    for (long long i = tt; i >= 1; -- i)
    {
        if(i == tt)
        {
            dp[i] = 0;
            if(!marked[i])
                maxx = 0;
            continue;
        }
        for (long long j = 0; j < g[i].size(); ++ j)
        {
            long long nb = g[i][j];
            if(dp[nb] != -1)dp[i] = max(dp[i], dp[nb] + 1);
        }
       /// cout << dp[i] << endl;
        if(!marked[i])maxx = max(maxx, dp[i]);
    }
    cout << maxx << endl;
}
int main()
{
    speed();

    read();
    precompute_small();
    while(q --)
    {
        cin >> tt >> yy;

        for (long long i = 1; i <= yy; ++ i)
        {
            cin >> c[i];
            marked[c[i]] = 1;
        }
        if(yy  >= sqrt(n))
        {
            solve_big();
        }
        else solve_small();
        for (long long i = 1; i <= yy; ++ i)
        {
             marked[c[i]] = 0;
        }
    }
    return 0;
}
/***
12 17 1
1 2
2 3
3 4
1 5
2 6
3 7
4 8
5 6
6 7
7 8
5 9
6 10
7 11
8 12
9 10
10 11
11 12
6 3 1 7 12

5 6 3
1 2
2 4
3 4
1 3
3 5
4 5
4 1 1
5 2 2 3
2 3 1 4 5
/*/

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

bitaro.cpp: In function 'void precompute_small()':
bitaro.cpp:80:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for (long long j = 0; j < grev[i].size(); ++ j)
      |                               ~~^~~~~~~~~~~~~~~~
bitaro.cpp: In function 'void solve_small()':
bitaro.cpp:99:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (long long i = 0; i < opt[tt].size(); ++ i)
      |                           ~~^~~~~~~~~~~~~~~~
bitaro.cpp: In function 'void solve_big()':
bitaro.cpp:122:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |         for (long long j = 0; j < g[i].size(); ++ j)
      |                               ~~^~~~~~~~~~~~~
bitaro.cpp:112:26: warning: unused variable 'cnt' [-Wunused-variable]
  112 |     long long maxx = -1, cnt = 0;
      |                          ^~~

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