Submission #5217254
Source Code Expand
#include <iostream> #include <stdlib.h> using namespace std; int main() { int n,s1,s2,s3,cnt = 0; cin>>n>>s1>>s2; int a[n],b[n]; for(int i = 0;i < n;i++) cin>>a[i]>>b[i]; for(int i = 0;i < n;i++) { for(int j = i + 1;j < n;j++) { s3 = abs((a[i] - a[j]) * (b[i] - b[j])); if(s3 > s1 && s3 < s2) cnt++; } } cout<<cnt; return 0; }
Submission Info
Submission Time | |
---|---|
Task | H - 平和協定 |
User | steven1029 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 459 Byte |
Status | WA |
Exec Time | 2615 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 10 | 0 / 90 | ||||||
Status |
|
|
|
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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 4 ms | 256 KB |
subtask1_02.txt | WA | 7 ms | 256 KB |
subtask1_03.txt | WA | 6 ms | 256 KB |
subtask1_04.txt | WA | 10 ms | 256 KB |
subtask1_05.txt | WA | 5 ms | 256 KB |
subtask1_06.txt | WA | 8 ms | 256 KB |
subtask1_07.txt | WA | 3 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 12 ms | 256 KB |
subtask1_10.txt | WA | 12 ms | 256 KB |
subtask1_11.txt | WA | 12 ms | 256 KB |
subtask1_12.txt | WA | 12 ms | 256 KB |
subtask1_13.txt | WA | 12 ms | 256 KB |
subtask1_14.txt | WA | 12 ms | 256 KB |
subtask2_01.txt | WA | 31 ms | 256 KB |
subtask2_02.txt | WA | 217 ms | 384 KB |
subtask2_03.txt | WA | 119 ms | 384 KB |
subtask2_04.txt | WA | 207 ms | 384 KB |
subtask2_05.txt | WA | 1145 ms | 512 KB |
subtask2_06.txt | WA | 909 ms | 512 KB |
subtask2_07.txt | WA | 101 ms | 256 KB |
subtask2_08.txt | WA | 274 ms | 384 KB |
subtask2_09.txt | WA | 869 ms | 512 KB |
subtask2_10.txt | WA | 2610 ms | 640 KB |
subtask2_11.txt | WA | 2607 ms | 640 KB |
subtask2_12.txt | WA | 2606 ms | 640 KB |
subtask2_13.txt | WA | 2610 ms | 640 KB |
subtask2_14.txt | WA | 2613 ms | 640 KB |
subtask2_15.txt | WA | 2606 ms | 640 KB |
subtask2_16.txt | WA | 2608 ms | 640 KB |
subtask2_17.txt | WA | 2609 ms | 640 KB |
subtask2_18.txt | WA | 2611 ms | 640 KB |
subtask2_19.txt | WA | 2606 ms | 640 KB |
subtask2_20.txt | WA | 2608 ms | 640 KB |
subtask2_21.txt | WA | 2607 ms | 640 KB |
subtask2_22.txt | WA | 2606 ms | 640 KB |
subtask2_23.txt | WA | 2604 ms | 640 KB |
subtask2_24.txt | WA | 2606 ms | 640 KB |
subtask2_25.txt | WA | 2607 ms | 640 KB |
subtask2_26.txt | WA | 2611 ms | 640 KB |
subtask2_27.txt | WA | 2609 ms | 640 KB |
subtask2_28.txt | WA | 2606 ms | 640 KB |
subtask2_29.txt | WA | 2604 ms | 640 KB |
subtask2_30.txt | WA | 2615 ms | 640 KB |
subtask2_31.txt | WA | 2605 ms | 640 KB |