Submission #1127703


Source Code Expand

#include <cstdio>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
using ll = long long;
using namespace std;
#define MAX_N 50000
const int inf = 1e9+7;
int a[MAX_N + 10];
int b[MAX_N + 10];
int main() {
    repeat (x, MAX_N + 10) a[x] = b[x] = inf;
    int n, s1, s2; scanf("%d%d%d", &n, &s1, &s2);
    repeat (i,n) scanf("%d%d", &a[i], &b[i]);
    int cnt = 0;
    repeat (x,n) {
        for (int y = x+1; y < n; y += 8) {
            ll d0 = (a[x] - a[y  ]) *(ll) (b[x] - b[y  ]);
            ll d1 = (a[x] - a[y+1]) *(ll) (b[x] - b[y+1]);
            ll d2 = (a[x] - a[y+2]) *(ll) (b[x] - b[y+2]);
            ll d3 = (a[x] - a[y+3]) *(ll) (b[x] - b[y+3]);
            ll d4 = (a[x] - a[y+4]) *(ll) (b[x] - b[y+4]);
            ll d5 = (a[x] - a[y+5]) *(ll) (b[x] - b[y+5]);
            ll d6 = (a[x] - a[y+6]) *(ll) (b[x] - b[y+6]);
            ll d7 = (a[x] - a[y+7]) *(ll) (b[x] - b[y+7]);
            if (s1 <= d0 and d0 <= s2) ++ cnt;
            if (s1 <= d1 and d1 <= s2) ++ cnt;
            if (s1 <= d2 and d2 <= s2) ++ cnt;
            if (s1 <= d3 and d3 <= s2) ++ cnt;
            if (s1 <= d4 and d4 <= s2) ++ cnt;
            if (s1 <= d5 and d5 <= s2) ++ cnt;
            if (s1 <= d6 and d6 <= s2) ++ cnt;
            if (s1 <= d7 and d7 <= s2) ++ cnt;
        }
    }
    printf("%d\n", cnt);
    return 0;
}

Submission Info

Submission Time
Task H - 平和協定
User kimiyuki
Language C++14 (Clang 3.8.0)
Score 100
Code Size 1356 Byte
Status AC
Exec Time 2203 ms
Memory 768 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 10 / 10 90 / 90
Status
AC × 3
AC × 17
AC × 48
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 640 KB
sample_02.txt AC 1 ms 640 KB
sample_03.txt AC 1 ms 640 KB
subtask1_01.txt AC 3 ms 640 KB
subtask1_02.txt AC 5 ms 640 KB
subtask1_03.txt AC 5 ms 640 KB
subtask1_04.txt AC 8 ms 640 KB
subtask1_05.txt AC 3 ms 640 KB
subtask1_06.txt AC 6 ms 640 KB
subtask1_07.txt AC 3 ms 640 KB
subtask1_08.txt AC 1 ms 640 KB
subtask1_09.txt AC 10 ms 640 KB
subtask1_10.txt AC 10 ms 640 KB
subtask1_11.txt AC 10 ms 640 KB
subtask1_12.txt AC 10 ms 640 KB
subtask1_13.txt AC 10 ms 640 KB
subtask1_14.txt AC 10 ms 640 KB
subtask2_01.txt AC 25 ms 640 KB
subtask2_02.txt AC 179 ms 640 KB
subtask2_03.txt AC 103 ms 768 KB
subtask2_04.txt AC 159 ms 640 KB
subtask2_05.txt AC 894 ms 640 KB
subtask2_06.txt AC 761 ms 640 KB
subtask2_07.txt AC 82 ms 640 KB
subtask2_08.txt AC 209 ms 640 KB
subtask2_09.txt AC 729 ms 640 KB
subtask2_10.txt AC 2195 ms 640 KB
subtask2_11.txt AC 2195 ms 640 KB
subtask2_12.txt AC 2195 ms 640 KB
subtask2_13.txt AC 2195 ms 640 KB
subtask2_14.txt AC 2195 ms 640 KB
subtask2_15.txt AC 2195 ms 640 KB
subtask2_16.txt AC 2195 ms 640 KB
subtask2_17.txt AC 2195 ms 640 KB
subtask2_18.txt AC 2195 ms 640 KB
subtask2_19.txt AC 2195 ms 640 KB
subtask2_20.txt AC 2195 ms 640 KB
subtask2_21.txt AC 2195 ms 640 KB
subtask2_22.txt AC 2203 ms 640 KB
subtask2_23.txt AC 2195 ms 640 KB
subtask2_24.txt AC 2195 ms 640 KB
subtask2_25.txt AC 2195 ms 640 KB
subtask2_26.txt AC 2195 ms 640 KB
subtask2_27.txt AC 2195 ms 640 KB
subtask2_28.txt AC 2195 ms 640 KB
subtask2_29.txt AC 2195 ms 640 KB
subtask2_30.txt AC 2170 ms 640 KB
subtask2_31.txt AC 2195 ms 640 KB