oj.uz

답안 #111080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111080 2019-05-13T15:33:15 Z igzi Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 268032 KB 
#include <bits/stdc++.h>
#define D 303
#define maxN 100005
 
using namespace std;
 
vector <int> adj[maxN],u;
vector <pair<int,int>> d[maxN];
bool mar[maxN];
int n,m,q,i,j,x,y,t,ans,dp[maxN];

vector<pair<int,int>> dodaj(vector <pair<int,int>> a,vector <pair<int,int>> b){
vector<pair<int,int>> v;
int i,j;
i=j=0;
while(i<a.size() && j<b.size()){
    if(a[i].first>=b[j].first+1) {v.push_back(a[i]); i++;}
    else {v.push_back({b[j].first+1,b[j].second}); j++;}
}
while(i<a.size()){
    v.push_back(a[i]); i++;
}
while(j<b.size()){
    v.push_back({b[j].first+1,b[j].second}); j++;
}
vector<pair<int,int>> u;
for(i=0;i<v.size();i++){
if(!mar[v[i].second]){u.push_back(v[i]); mar[v[i].second]=true;}
}
for(i=0;i<u.size();i++) mar[u[i].second]=false;
while(u.size()>=D) u.pop_back();
return u;
}
 
int main()
{
    srand(time(NULL));
    std::ios_base::sync_with_stdio(0);
    cin>>n>>m>>q;
    for(i=0;i<m;i++){
        cin>>x>>y;
        adj[y].push_back(x);
    }
    for(i=1;i<=n;i++){
        d[i].push_back({0,i});
        for(j=0;j<adj[i].size();j++){
            d[i]=dodaj(d[i],d[adj[i][j]]);
        }
    }
    while(q--){
        cin>>t>>x;
        u.clear();
        for(i=0;i<x;i++){
            cin>>y;
            mar[y]=true;
            u.push_back(y);
        }
        if(x<D-2){
            ans=-1;
            for(i=0;i<d[t].size();i++){
                if(!mar[d[t][i].second]){
                    ans=d[t][i].first;
                    break;
                }
            }
        }
        else{
            for(i=1;i<=t;i++){
                dp[i]=-1;
                if(!mar[i]) dp[i]=0;
                for(j=0;j<adj[i].size();j++){
                    if(dp[adj[i][j]]!=-1) dp[i]=max(dp[i],dp[adj[i][j]]+1);
                }
            }
            ans=dp[t];
        }
        for(i=0;i<u.size();i++) mar[u[i]]=false;
        cout<<ans<<"\n";
    }
    return 0;
}

Compilation message

bitaro.cpp: In function 'std::vector<std::pair<int, int> > dodaj(std::vector<std::pair<int, int> >, std::vector<std::pair<int, int> >)':
bitaro.cpp:16:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 while(i<a.size() && j<b.size()){
       ~^~~~~~~~~
bitaro.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 while(i<a.size() && j<b.size()){
                     ~^~~~~~~~~
bitaro.cpp:20:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 while(i<a.size()){
       ~^~~~~~~~~
bitaro.cpp:23:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 while(j<b.size()){
       ~^~~~~~~~~
bitaro.cpp:27:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
bitaro.cpp:30:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<u.size();i++) mar[u[i].second]=false;
         ~^~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:46:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<adj[i].size();j++){
                 ~^~~~~~~~~~~~~~
bitaro.cpp:60:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(i=0;i<d[t].size();i++){
                     ~^~~~~~~~~~~~
bitaro.cpp:71:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(j=0;j<adj[i].size();j++){
                         ~^~~~~~~~~~~~~~
bitaro.cpp:77:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(i=0;i<u.size();i++) mar[u[i]]=false;
                 ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 11 ms 5504 KB Output is correct
6 Correct 12 ms 5632 KB Output is correct
7 Correct 13 ms 5464 KB Output is correct
8 Correct 26 ms 8448 KB Output is correct
9 Correct 23 ms 8448 KB Output is correct
10 Correct 22 ms 8440 KB Output is correct
11 Correct 21 ms 8064 KB Output is correct
12 Correct 15 ms 6528 KB Output is correct
13 Correct 23 ms 7808 KB Output is correct
14 Correct 20 ms 7040 KB Output is correct
15 Correct 18 ms 6144 KB Output is correct
16 Correct 23 ms 7040 KB Output is correct
17 Correct 20 ms 7424 KB Output is correct
18 Correct 15 ms 6272 KB Output is correct
19 Correct 21 ms 7280 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 11 ms 5504 KB Output is correct
6 Correct 12 ms 5632 KB Output is correct
7 Correct 13 ms 5464 KB Output is correct
8 Correct 26 ms 8448 KB Output is correct
9 Correct 23 ms 8448 KB Output is correct
10 Correct 22 ms 8440 KB Output is correct
11 Correct 21 ms 8064 KB Output is correct
12 Correct 15 ms 6528 KB Output is correct
13 Correct 23 ms 7808 KB Output is correct
14 Correct 20 ms 7040 KB Output is correct
15 Correct 18 ms 6144 KB Output is correct
16 Correct 23 ms 7040 KB Output is correct
17 Correct 20 ms 7424 KB Output is correct
18 Correct 15 ms 6272 KB Output is correct
19 Correct 21 ms 7280 KB Output is correct
20 Correct 1725 ms 9596 KB Output is correct
21 Correct 1510 ms 9760 KB Output is correct
22 Correct 1610 ms 9804 KB Output is correct
23 Correct 1786 ms 9756 KB Output is correct
24 Correct 1804 ms 255924 KB Output is correct
25 Correct 1981 ms 268032 KB Output is correct
26 Execution timed out 2041 ms 246820 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 11 ms 5504 KB Output is correct
6 Correct 12 ms 5632 KB Output is correct
7 Correct 13 ms 5464 KB Output is correct
8 Correct 26 ms 8448 KB Output is correct
9 Correct 23 ms 8448 KB Output is correct
10 Correct 22 ms 8440 KB Output is correct
11 Correct 21 ms 8064 KB Output is correct
12 Correct 15 ms 6528 KB Output is correct
13 Correct 23 ms 7808 KB Output is correct
14 Correct 20 ms 7040 KB Output is correct
15 Correct 18 ms 6144 KB Output is correct
16 Correct 23 ms 7040 KB Output is correct
17 Correct 20 ms 7424 KB Output is correct
18 Correct 15 ms 6272 KB Output is correct
19 Correct 21 ms 7280 KB Output is correct
20 Correct 1725 ms 9596 KB Output is correct
21 Correct 1510 ms 9760 KB Output is correct
22 Correct 1610 ms 9804 KB Output is correct
23 Correct 1786 ms 9756 KB Output is correct
24 Correct 1804 ms 255924 KB Output is correct
25 Correct 1981 ms 268032 KB Output is correct
26 Execution timed out 2041 ms 246820 KB Time limit exceeded
27 Halted 0 ms 0 KB -