Submission #1542007
Source Code Expand
#include<iostream> #include<algorithm> #include<cstdio> #include<functional> #include<vector> #include<map> #include<string> #include<set> #include<unordered_set> #include<unordered_map> #define P pair<int,int> #define int long long using namespace std; P S, G; P k[200000]; vector<int>V; int dp[200001]; signed main(){ cin >> S.first >> S.second; cin >> G.first >> G.second; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> k[i].first >> k[i].second; } sort(k, k + n); if (S.first > G.first)swap(S, G); for (int i = 0; i < n; i++) { if (G.first > k[i].first&&S.first < k[i].first&&max(S.first,G.first) > k[i].second&&min(S.first, G.first) < k[i].second) { V.push_back(k[i].second); } } memset(dp, 0x3f, sizeof(dp)); dp[0] = 0; for (int i = 0; i < V.size(); i++) { *lower_bound(dp, dp + n, V[i]) = V[i]; } int i = 0; for (i = V.size(); i >= 0; i--) { if (dp[i] <= 1000000000000000ll)break; } printf("%.20lf\n", (G.first - S.first + abs(G.second - S.second)) * 100 - (20 - double(20)*3.141592653589793238462*0.25)*i); getchar(); getchar(); }
Submission Info
Submission Time | |
---|---|
Task | C - Fountain Walk |
User | naoki2016 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1122 Byte |
Status | CE |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:29: error: ‘memset’ was not declared in this scope memset(dp, 0x3f, sizeof(dp)); ^