Submission #199702

#TimeUsernameProblemLanguageResultExecution timeMemory
199702FieryPhoenixHorses (IOI15_horses)C++11
Compilation error
0 ms0 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <cstdio> #include <map> #include <queue> #include <set> #include <iomanip> #include <deque> #include <cassert> #include <ctime> #include <cstring> #include <cstdlib> #include <chrono> #include <ctime> #include <random> #include <stack> #include <unordered_set> #include <unordered_map> #include <iterator> #include <climits> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); typedef long long ll; typedef long double ld; #define INF 2001001001 #define MOD 1000000007 int worth[15]; int init(int N, int X[], int Y[]){ for (int i=N-1;i>=0;i--) worth[i]=X[i]*max(Y[i],worth[i+1]); return worth[0]; }

Compilation message (stderr)

/tmp/ccjeKBPq.o: In function `main':
grader.c:(.text.startup+0x71a): undefined reference to `updateX(int, int)'
grader.c:(.text.startup+0x8a6): undefined reference to `updateY(int, int)'
collect2: error: ld returned 1 exit status