oj.uz

답안 #821178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821178 2023-08-11T07:57:32 Z Denkata Marshmallow Molecules (CCO19_day2problem2) C++17
5 / 25
 4000 ms 40664 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+3;
int i,j,p,q,n,m,k;
vector <int> v[maxn];
vector <int> rev[maxn];
int marked[maxn];
long long ans;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    ans = m;
    for(i=1;i<=m;i++)
    {
        cin>>p>>q;
        v[p].push_back(q);
        rev[q].push_back(p);
    }
    for(i=3;i<=n;i++)
    {
        if(rev[i].size()==i-1)
            continue;
        queue <pair<int,int>> qu;
        marked[i] = i;
        for(auto j:rev[i])
        {
            qu.push({j,0});
            marked[j] = i;
        }
        while(!qu.empty())
        {
            auto t = qu.front();
            qu.pop();
            //cout<<t.first<<" "<<t.second<<endl;
            if(t.second>0)
            {
                ans++;
                v[t.first].push_back(i);
                //rev[i].push_back(t.first);
            }
            for(auto j:v[t.first])
            {
                if(marked[j]!=i && j<i)
                {
                    qu.push({j,t.second+1});
                    marked[j]=i;
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:24:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if(rev[i].size()==i-1)
      |            ~~~~~~~~~~~~~^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4968 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 3 ms 5084 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5072 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4968 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 3 ms 5084 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5072 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Execution timed out 4025 ms 33684 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4046 ms 40664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4968 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 3 ms 5084 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5072 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Execution timed out 4025 ms 33684 KB Time limit exceeded
17 Halted 0 ms 0 KB -