Submission #1012794

#TimeUsernameProblemLanguageResultExecution timeMemory
1012794Ivo_12Stray Cat (JOI20_stray)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #define ll long long #define mp make_pair #define pb push_back #define F first #define S second #define pii pair < int, int > #define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); using namespace std; const int N = 2e4+10, M = 2e4+10, A = 4; int ga, gb; vector < int > Mark( int n, int m, int a, int b, vector < int > t1, vector < int > t2 ) { vector < pii > edges[N]; vector < int > oznake; int dis[N]; queue < int > q; for(int i = 0; i < m; i++) { edges[t1[i]].pb(mp(t2[i], i)); edges[t2[i]].pb(mp(t1[i], i)); oznake.pb(0); } dis[0] = 1; q.push(0); int cur; int sus; while(!q.empty()) { cur = q.front(); q.pop(); for(int i = 0; i < (int) edges[cur].size(); i++) { sus = edges[cur][i].F; if(dis[sus] == 0) { q.push(sus); dis[sus] = dis[cur]+1; } } } if(a>=3) { q.push(0); while(!q.empty()) { cur = q.front(); q.pop(); for(int i = 0; i < (int) edges[cur].size(); i++) { sus = edges[cur][i].F; if(dis[sus] >= dis[cur]) { q.push(sus); oznake[edges[cur][i].S] = (dis[cur] - 1) % 3; } } } } else { } return oznake; }
#include <bits/stdc++.h> #define ll long long #define mp make_pair #define pb push_back #define F first #define S second #define pii pair < int, int > #define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); using namespace std; const int N = 2e4+10, M = 2e4+10, A = 4; int ga, gb; void Init( int a, int b ) { ga = a; gb = b; } int move( vector < int > v ) { if((int) v.size()>=3) { if(v[0] && v[1]) return 0; if(v[2] && v[0]) return 2; if(v[1] && v[2]) return 1; if(!(v[0] || v[1])) return 2; if(!(v[2] || v[0])) return 1; if(!(v[1] || v[2])) return 0; } return -1; }

Compilation message (stderr)

/usr/bin/ld: /tmp/cc88ZSnO.o: in function `main':
grader_catherine.cpp:(.text.startup+0xcfa): undefined reference to `Move(std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status