Submission #8391

#	Time	Username	Problem	Language	Result	Execution time	Memory
8391		tncks0121	Wall construction (kriii2_WA)	C++98	0 / 4	0 ms	1100 KiB

WA

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h> 
#include <time.h>

using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;

int N, R;
lf X[105], Y[105];

int main() {
	scanf("%d%d", &N, &R);
	for(int i = 1; i <= N; i++) scanf("%lf%lf", &X[i], &Y[i]);
	X[N + 1] = X[1]; Y[N + 1] = Y[1];

	lf res = acos(-1) * 2 * R;
	for(int i = 1; i <= N; i++) res += hypot(X[i] - X[i + 1], Y[i] - Y[i + 1]);
	printf("%.2lf\n", res);

	return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 3