제출 #49369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49369		mirbek01	철인 이종 경기 (APIO18_duathlon)	C++17	0 / 100	1091 ms	204756 KiB

count_triplets

# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, m, used[N];
vector <int> g[N], vec;
map < pair <int, pair <int, int> > , int> ans;

void dfs(int v, int pr = 0){
      used[v] = 1;
      vec.push_back(v);
      for(int i = 1; i < vec.size() - 1; i ++){
            ans[{vec[0], {vec[i], vec.back()}}] = 1;
      }
      for(int to : g[v]){
            if(to == pr || used[to]) continue;
            dfs(to, v);
      }
      vec.pop_back();
      used[v] = 0;
}

int main(){
      cin >> n >> m;

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

      for(int i = 1; i <= n; i ++)
            dfs(i);

      cout << ans.size() << endl;
}

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

count_triplets.cpp: In function 'void dfs(int, int)':
count_triplets.cpp:14:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 1; i < vec.size() - 1; i ++){
                      ~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10