Submission #1540584
Source Code Expand
#include <iostream> #include <cstdio> #include <vector> #include <iomanip> #include <cmath> #include <utility> #include <algorithm> using namespace std; typedef long double ld; typedef pair<int,int> pii; const int MAX_N = 2e5 + 6; const ld pi = acos(-1); const int INF= 1e9 + 7; int main () { int x1,y1,x2,y2; scanf("%d %d %d %d",&x1,&y1,&x2,&y2); if (x1 > x2) swap(x1,x2); if (y1 > y2) swap(y1,y2); vector<pii> v; int n; scanf("%d",&n); for (int i=1;n>=i;i++) { int a,b; scanf("%d %d",&a,&b); if (x1 <= a && a <= x2 && y1 <= b && b<=y2) { v.push_back(make_pair(a,b)); } } sort(v.begin(),v.end()); ld ans = y2+x2-x1-y1; if (x1 == x2 || y1 == y2) { ans *= 100; ans += (ld(v.size())*(10*(2.0-pi/2)) ); cout<<fixed<<setprecision(15)<<ans<<endl; return 0; } ans *= 100; vector<int> dp; dp.resize(v.size()+2,INF); dp[0] = -INF; sort(v.begin(),v.end()); for (int i=0;v.size()>i;i++) { int t=v[i].second; int tt=t; int pos=lower_bound(dp.begin(),dp.end(),tt) - dp.begin(); dp[pos] = t; } int qq=0; for (int i=0;dp.size()>i;i++) { if (dp[i+1] == INF) { qq=i; break; } } ans -= qq*(10*(2.0-pi/2)); cout<<fixed<<setprecision(15)<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Fountain Walk |
User | yp155136 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1257 Byte |
Status | WA |
Exec Time | 72 ms |
Memory | 2544 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:18:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d %d %d",&x1,&y1,&x2,&y2); ^ ./Main.cpp:23:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:26:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&a,&b); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 900 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | WA | 14 ms | 256 KB |
subtask_1_10.txt | WA | 29 ms | 384 KB |
subtask_1_11.txt | WA | 8 ms | 256 KB |
subtask_1_12.txt | WA | 71 ms | 2544 KB |
subtask_1_13.txt | WA | 32 ms | 256 KB |
subtask_1_14.txt | WA | 15 ms | 256 KB |
subtask_1_15.txt | WA | 8 ms | 256 KB |
subtask_1_16.txt | WA | 71 ms | 2544 KB |
subtask_1_17.txt | AC | 26 ms | 256 KB |
subtask_1_18.txt | WA | 20 ms | 256 KB |
subtask_1_19.txt | AC | 20 ms | 256 KB |
subtask_1_20.txt | AC | 69 ms | 2544 KB |
subtask_1_21.txt | AC | 71 ms | 2544 KB |
subtask_1_22.txt | WA | 66 ms | 2544 KB |
subtask_1_23.txt | WA | 64 ms | 2544 KB |
subtask_1_24.txt | AC | 1 ms | 256 KB |
subtask_1_25.txt | AC | 1 ms | 256 KB |
subtask_1_26.txt | AC | 1 ms | 256 KB |
subtask_1_27.txt | AC | 1 ms | 256 KB |
subtask_1_28.txt | AC | 37 ms | 384 KB |
subtask_1_29.txt | WA | 40 ms | 384 KB |
subtask_1_30.txt | AC | 72 ms | 2544 KB |
subtask_1_31.txt | AC | 49 ms | 2544 KB |
subtask_1_32.txt | AC | 55 ms | 2544 KB |
subtask_1_33.txt | AC | 53 ms | 2544 KB |
subtask_1_34.txt | AC | 49 ms | 2544 KB |
subtask_1_35.txt | AC | 59 ms | 2544 KB |
subtask_1_36.txt | AC | 60 ms | 2544 KB |
subtask_1_37.txt | AC | 59 ms | 2544 KB |
subtask_1_38.txt | AC | 59 ms | 2544 KB |
subtask_1_39.txt | AC | 59 ms | 2544 KB |
subtask_1_40.txt | AC | 57 ms | 2544 KB |
subtask_1_41.txt | AC | 57 ms | 2544 KB |