Submission #710478

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
710478	2023-03-15 09:26:39	aggrovector	Race (IOI11_race)	C++17	Compilation error	0 ms	0 KiB

race

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n,k,i,j,x,y,w,used[200005],vi[200005],fa[200005],subtree[200005],d[200005],d1[200005];
long long ans;
vector<pair<int,int>> v[200005];
vector<int> centroids;
unordered_map<int,int> cnt,cnt1;
bool flag,iscentroid;
const long long INF=1e15;
void dfs(int x, int f) {//subtree size
  vi[x]=1;
  fa[x]=f;
  for (int i=0;i<v[x].size();i++) {
    if (vi[v[x][i].first]==0 && used[v[x][i].first]==0) {
      d1[v[x][i].first]=d1[x]+1;
      dfs(v[x][i].first,f);
      subtree[x]+=subtree[v[x][i].first];
    }
  }
  subtree[x]++;
}
void dfs1(int x) {//distance by length and number of nodes
  vi[x]=1;
  for (int i=0;i<v[x].size();i++) {
    if (vi[v[x][i].first]==0 && used[v[x][i].first]==0) {
      d[v[x][i].first]=d[x]+v[x][i].second;
      d1[v[x][i].first]=d1[x]+1;
      dfs1(v[x][i].first);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

race.cpp: In function 'void dfs(int, int)':
race.cpp:14:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i=0;i<v[x].size();i++) {
      |               ~^~~~~~~~~~~~
race.cpp: In function 'void dfs1(int)':
race.cpp:26:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for (int i=0;i<v[x].size();i++) {
      |               ~^~~~~~~~~~~~
race.cpp: In function 'void dfs2(int, int)':
race.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for (int i=0;i<v[x].size();i++) {
      |               ~^~~~~~~~~~~~
race.cpp: In function 'int main()':
race.cpp:121:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |    for (j=0;j<v[i].size();j++) {
      |             ~^~~~~~~~~~~~
race.cpp:143:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |   for (i=0;i<centroids.size();i++) {
      |            ~^~~~~~~~~~~~~~~~~
race.cpp:161:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |   for (i=0;i<centroids.size();i++) {
      |            ~^~~~~~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccagjbo6.o: in function `main':
race.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccf1r774.o:grader.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccf1r774.o: in function `main':
grader.cpp:(.text.startup+0x28): undefined reference to `best_path(int, int, int (*) [2], int*)'
collect2: error: ld returned 1 exit status