oj.uz

Submission #9008

# Submission time Handle Problem Language Result Execution time Memory
9008 2014-09-27T10:31:38 Z mrcamel Wall construction (kriii2_WA) C++
1 / 4
 0 ms 1688 KB 
#include <cstdio>
#include <iostream>
#include <fstream>
#include <deque>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;

#define in cin
#define out cout
#define PII pair<int, int>
#define x first
#define y second
#define REP(i, s, e) for(int i=s; i<=e; i++)
#define pi 3.14159265358979323846

int main()
{
    int n, k; in >> n >> k;
    if( n == 2 )
    {
        double ax, ay; in >> ax >> ay;
        double bx, by; in >> bx >> by;

        out << fixed;
        out.precision(10);
        out << sqrt( (ax-bx)*(ax-bx) + (ay-by)*(ay-by) )*2.0 + pi*k*2.0;
    }
    else
    {
        return 0;
    }

    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1688 KB Output is correct
2 Correct 0 ms 1688 KB Output is correct
3 Correct 0 ms 1688 KB Output is correct
4 Correct 0 ms 1688 KB Output is correct
5 Correct 0 ms 1688 KB Output is correct

Subtask #2
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1684 KB Output isn't correct
2 Halted 0 ms 0 KB -