ALDS1_11_Bでのエラー

実現したいこと

ALDS1_11_Bを解きたい。https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_11_B&lang=ja

発生している問題・分からないこと

以下のようなエラーがでてくる。

エラーメッセージ

error
1prog.cc:13:13: error: 'std::vector<int> time' redeclared as different kind of entity
2   13 | vector<int> time;
3      |             ^~~~
4In file included from /opt/wandbox/gcc-13.2.0/lib/gcc/x86_64-pc-linux-gnu/13.2.0/include-fixed/pthread.h:32,
5                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/x86_64-pc-linux-gnu/bits/gthr-default.h:35,
6                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/x86_64-pc-linux-gnu/bits/gthr.h:148,
7                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/ext/atomicity.h:35,
8                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/bits/ios_base.h:39,
9                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/ios:44,
10                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/ostream:40,
11                 from /opt/wandbox/gcc-13.2.0/include/c++/13.2.0/iostream:41,
12                 from prog.cc:1:
13/usr/include/time.h:76:15: note: previous declaration 'time_t time(time_t*)'
14   76 | extern time_t time (time_t *__timer) __THROW;
15      |               ^~~~
16prog.cc: In function 'void dfs(const Graph&, int)':
17prog.cc:18:11: warning: pointer to a function used in arithmetic [-Wpointer-arith]
18   18 |     time[v] = T;
19      |           ^
20prog.cc:18:13: error: assignment of read-only location '*(time + ((sizetype)v))'
21   18 |     time[v] = T;
22      |     ~~~~~~~~^~~
23prog.cc: In function 'int main()':
24prog.cc:41:42: warning: pointer to a function used in arithmetic [-Wpointer-arith]
25   41 |     for(int i=0; i<n; i++) cout << time[i] << endl;
26      |                                          ^
27prog.cc:41:42: warning: comparing the result of pointer addition '(time + ((sizetype)i))' and NULL [-Waddress]

該当のソースコード

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstring>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;

vector<bool> seen;
vector<int> time;
int T = 0;
void dfs(const Graph &G, int v){
    seen[v] = true;
    T++;
    time[v] = T;
    
    for(auto next_v : G[v]){
        if(seen[next_v]) continue;
        dfs(G, next_v);
    }
}

int main() {
    int n; cin >> n;
    Graph G(n);
    for(int i=0; i<n; i++){
        int k; cin >> k;
        int p; cin >> p;
        for(int j=0; j<p; j++){
            int x; cin >> x;
            G[k - 1].push_back(x - 1);
        }
    }
    
    seen.assign(n, false);
    dfs(G, 0);

    for(int i=0; i<n; i++) cout << time[i] << endl;
}