Submission #245254


Source Code Expand

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
const double EPS=1e-9;

const int N = 50010;
int n,s1,s2;
int a[N],b[N];
int main(void){
	cin >> n >> s1 >> s2;
	REP(i,0,n) {
		cin >> a[i] >> b[i];
	}
	if (n >= 5000) return 1;
	ll c=0;
	REP(i,0,n) {
		REP(j,i+1,n) {
			ll tt = ll(a[i] - a[j]) * (b[i] - b[j]);
			if (tt >= s1 && tt <= s2) {
				c ++;
			}
		}
	}
	cout <<c  << endl;
}

Submission Info

Submission Time
Task H - 平和協定
User kobae964
Language C++ (G++ 4.6.4)
Score 10
Code Size 657 Byte
Status RE
Exec Time 82 ms
Memory 1184 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 10 / 10 0 / 90
Status
AC × 3
AC × 17
AC × 17
RE × 31
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 25 ms 816 KB
sample_02.txt AC 25 ms 736 KB
sample_03.txt AC 25 ms 804 KB
subtask1_01.txt AC 35 ms 804 KB
subtask1_02.txt AC 47 ms 804 KB
subtask1_03.txt AC 44 ms 804 KB
subtask1_04.txt AC 65 ms 796 KB
subtask1_05.txt AC 44 ms 800 KB
subtask1_06.txt AC 53 ms 804 KB
subtask1_07.txt AC 32 ms 808 KB
subtask1_08.txt AC 25 ms 932 KB
subtask1_09.txt AC 71 ms 804 KB
subtask1_10.txt AC 72 ms 792 KB
subtask1_11.txt AC 72 ms 804 KB
subtask1_12.txt AC 74 ms 744 KB
subtask1_13.txt AC 73 ms 804 KB
subtask1_14.txt AC 72 ms 812 KB
subtask2_01.txt RE 30 ms 796 KB
subtask2_02.txt RE 38 ms 808 KB
subtask2_03.txt RE 34 ms 800 KB
subtask2_04.txt RE 37 ms 804 KB
subtask2_05.txt RE 57 ms 936 KB
subtask2_06.txt RE 55 ms 920 KB
subtask2_07.txt RE 34 ms 804 KB
subtask2_08.txt RE 40 ms 928 KB
subtask2_09.txt RE 55 ms 928 KB
subtask2_10.txt RE 75 ms 1064 KB
subtask2_11.txt RE 73 ms 1064 KB
subtask2_12.txt RE 75 ms 1056 KB
subtask2_13.txt RE 75 ms 1060 KB
subtask2_14.txt RE 82 ms 1068 KB
subtask2_15.txt RE 73 ms 1056 KB
subtask2_16.txt RE 73 ms 1060 KB
subtask2_17.txt RE 75 ms 1060 KB
subtask2_18.txt RE 75 ms 1056 KB
subtask2_19.txt RE 75 ms 1052 KB
subtask2_20.txt RE 77 ms 1184 KB
subtask2_21.txt RE 75 ms 1180 KB
subtask2_22.txt RE 74 ms 1060 KB
subtask2_23.txt RE 75 ms 1052 KB
subtask2_24.txt RE 74 ms 1072 KB
subtask2_25.txt RE 75 ms 1124 KB
subtask2_26.txt RE 73 ms 1056 KB
subtask2_27.txt RE 75 ms 1064 KB
subtask2_28.txt RE 73 ms 1064 KB
subtask2_29.txt RE 75 ms 1060 KB
subtask2_30.txt RE 62 ms 1060 KB
subtask2_31.txt RE 75 ms 1068 KB