제출 #546914

#제출 시각아이디문제언어결과실행 시간메모리
546914fvogel499Roller Coaster Railroad (IOI16_railroad)C++17
컴파일 에러
0 ms0 KiB
/* * File created on 04/08/2022 at 21:58:56. * Link to problem: * Description: * Time complexity: O() * Space complexity: O() * Status: --- * Copyright: Ⓒ 2022 Francois Vogel */ #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <functional> using namespace std; using namespace __gnu_pbds; #define pii pair<int, int> #define f first #define s second #define vi vector<int> #define all(x) x.begin(), x.end() #define size(x) (int)((x).size()) #define pb push_back #define ins insert #define cls clear #define int ll #define ll long long #define ld long double typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; int plan_roller_coaster_act(vi from, vi to) { map<int, int> m; for (int i = 0; i < size(from); i++) { m[from[i]-1] = m[from[i]] = m[from[i]+1] = m[to[i]-1] = m[to[i]] = m[to[i]+1] = 0; } for (int i = 0; i < size(from); i++) { m[from[i]]++; m[to[i]]--; } int sum = 0; for (auto i : m) { sum += i.s; if (sum > 1) return 1; } return 0; } int plan_roller_coaster_act(vector<signed> from, vector<signed> to) { return plan_roller_coaster_act(from, to); } // signed main() { // cin.tie(0); // ios_base::sync_with_stdio(0); // int n; // cin >> n; // vector<signed> from(n), to(n); // for (int i = 0; i < n; i++) cin >> from[i]; // for (int i = 0; i < n; i++) cin >> to[i]; // cout << plan_roller_coaster(from, to) << endl; // cout.flush(); // int d = 0; // d++; // }

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

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