oj.uz

답안 #401423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401423 2021-05-10T08:01:59 Z Hazem 철인 이종 경기 (APIO18_duathlon) C++14
0 / 100
 1000 ms 1048580 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define LL long long
#define F first
#define S second
#define pii pair<int,int>
#define piii pair<pair<int,int>,int>

const int N = 2e5+10;
const int M = 200;
const LL INF = 1e9;
const LL LINF = 1e14;
const LL MOD = 1e9+7;
const double PI = 3.141592653589793;

vector<int>adj[N];
LL sizes[N],n,m;
bool vis[N];

int dfs1(int i,int pre){

    int ret = 1;
    for(auto x:adj[i])
        if(x!=pre)
            ret += dfs1(x,i);

    return ret;
}

LL dfs(int i,int pre,int sz){

    vis[i] = sizes[i] = 1;
    LL ret = 0;
    for(auto x:adj[i])
        if(x!=pre){
            ret += dfs(x,i,sz);
            sizes[i] += sizes[x];
        }

    LL cur = sz-1;
    for(auto x:adj[i]){
        LL v = 0;
        if(x==pre)v = n-sizes[i];
        else v = sizes[x];
        ret += (cur-v)*v;
    }

    return ret;
}

int main(){

    //freopen("out.txt","w",stdout);
    //freopen("out.txt","r",stdin);

    scanf("%d%d",&n,&m);

    for(int i=1;i<=m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        adj[u].push_back(v);
        adj[v].push_back(u);        
    }

    LL ans = 0;
    for(int i=1;i<=n;i++)
        if(!vis[i]){
            int sz = dfs1(i,i);
            ans += dfs(i,i,sz);
        }

    printf("%lld\n",ans);
}

Compilation message

count_triplets.cpp: In function 'long long int dfs(int, int, int)':
count_triplets.cpp:33:23: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   33 |     vis[i] = sizes[i] = 1;
      |              ~~~~~~~~~^~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:57:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   57 |     scanf("%d%d",&n,&m);
      |            ~^    ~~
      |             |    |
      |             int* long long int*
      |            %lld
count_triplets.cpp:57:15: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
   57 |     scanf("%d%d",&n,&m);
      |              ~^     ~~
      |               |     |
      |               int*  long long int*
      |              %lld
count_triplets.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
count_triplets.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |         scanf("%d%d",&u,&v);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 573 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 573 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5028 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 4 ms 5116 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Incorrect 4 ms 4940 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 9048 KB Output is correct
2 Correct 65 ms 9012 KB Output is correct
3 Correct 75 ms 9028 KB Output is correct
4 Correct 78 ms 9044 KB Output is correct
5 Correct 60 ms 8996 KB Output is correct
6 Correct 72 ms 14028 KB Output is correct
7 Correct 78 ms 12356 KB Output is correct
8 Correct 82 ms 11460 KB Output is correct
9 Correct 95 ms 10580 KB Output is correct
10 Incorrect 60 ms 9108 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Runtime error 659 ms 1048580 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 9044 KB Output is correct
2 Correct 63 ms 8992 KB Output is correct
3 Runtime error 811 ms 1048580 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 573 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 573 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -