Submission #3207161


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin >> N;
  vector<pair<long long, long long> > xy(N);
  for (int i=0; i<N; i++) cin >> xy[i].first >> xy[i].second;
  int ans = 0;
  for (int i=0; i<N-2; i++){
    for (int j=i+1; j<N-1; j++){
      for (int k=j+1; k<N; k++){
        long long x1 = xy[j].first-xy[i].first, x2 = xy[k].first-xy[i].first,
            y1 = xy[j].second - xy[i].second, y2 = xy[k].second-xy[i].second;
      if ((abs(x1*y2-x2*y1)%2==0)&&(x1*y2-x2*y1!=0)) ans++;
      }
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task B - 格子点と整数
User integralyamada
Language C++14 (GCC 5.4.1)
Score 100
Code Size 576 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 75
Set Name Test Cases
All case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, case_17.txt, case_18.txt, case_19.txt, case_20.txt, case_21.txt, case_22.txt, case_23.txt, case_24.txt, case_25.txt, case_26.txt, case_27.txt, case_28.txt, case_29.txt, case_30.txt, case_31.txt, case_32.txt, case_33.txt, case_34.txt, case_35.txt, case_36.txt, case_37.txt, case_38.txt, case_39.txt, case_40.txt, case_41.txt, case_42.txt, case_43.txt, case_44.txt, case_45.txt, case_46.txt, case_47.txt, case_48.txt, case_49.txt, case_50.txt, case_51.txt, case_52.txt, case_53.txt, case_54.txt, case_55.txt, case_56.txt, case_57.txt, case_58.txt, case_59.txt, case_60.txt, case_61.txt, case_62.txt, case_63.txt, case_64.txt, case_65.txt, case_66.txt, case_67.txt, case_68.txt, case_69.txt, case_70.txt, case_71.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt
Case Name Status Exec Time Memory
case_01.txt AC 1 ms 256 KB
case_02.txt AC 2 ms 256 KB
case_03.txt AC 2 ms 256 KB
case_04.txt AC 1 ms 256 KB
case_05.txt AC 1 ms 256 KB
case_06.txt AC 2 ms 256 KB
case_07.txt AC 1 ms 256 KB
case_08.txt AC 1 ms 256 KB
case_09.txt AC 2 ms 256 KB
case_10.txt AC 1 ms 256 KB
case_11.txt AC 1 ms 256 KB
case_12.txt AC 1 ms 256 KB
case_13.txt AC 1 ms 256 KB
case_14.txt AC 1 ms 256 KB
case_15.txt AC 2 ms 256 KB
case_16.txt AC 1 ms 256 KB
case_17.txt AC 1 ms 256 KB
case_18.txt AC 1 ms 256 KB
case_19.txt AC 1 ms 256 KB
case_20.txt AC 1 ms 256 KB
case_21.txt AC 2 ms 256 KB
case_22.txt AC 1 ms 256 KB
case_23.txt AC 1 ms 256 KB
case_24.txt AC 1 ms 256 KB
case_25.txt AC 1 ms 256 KB
case_26.txt AC 1 ms 256 KB
case_27.txt AC 2 ms 256 KB
case_28.txt AC 1 ms 256 KB
case_29.txt AC 2 ms 256 KB
case_30.txt AC 1 ms 256 KB
case_31.txt AC 1 ms 256 KB
case_32.txt AC 1 ms 256 KB
case_33.txt AC 1 ms 256 KB
case_34.txt AC 1 ms 256 KB
case_35.txt AC 1 ms 256 KB
case_36.txt AC 1 ms 256 KB
case_37.txt AC 1 ms 256 KB
case_38.txt AC 1 ms 256 KB
case_39.txt AC 1 ms 256 KB
case_40.txt AC 1 ms 256 KB
case_41.txt AC 1 ms 256 KB
case_42.txt AC 2 ms 256 KB
case_43.txt AC 1 ms 256 KB
case_44.txt AC 1 ms 256 KB
case_45.txt AC 1 ms 256 KB
case_46.txt AC 1 ms 256 KB
case_47.txt AC 1 ms 256 KB
case_48.txt AC 1 ms 256 KB
case_49.txt AC 1 ms 256 KB
case_50.txt AC 2 ms 256 KB
case_51.txt AC 2 ms 256 KB
case_52.txt AC 2 ms 256 KB
case_53.txt AC 2 ms 256 KB
case_54.txt AC 2 ms 256 KB
case_55.txt AC 2 ms 256 KB
case_56.txt AC 2 ms 256 KB
case_57.txt AC 2 ms 256 KB
case_58.txt AC 2 ms 256 KB
case_59.txt AC 2 ms 256 KB
case_60.txt AC 2 ms 256 KB
case_61.txt AC 2 ms 256 KB
case_62.txt AC 2 ms 256 KB
case_63.txt AC 2 ms 256 KB
case_64.txt AC 2 ms 256 KB
case_65.txt AC 2 ms 256 KB
case_66.txt AC 2 ms 256 KB
case_67.txt AC 2 ms 256 KB
case_68.txt AC 2 ms 256 KB
case_69.txt AC 2 ms 256 KB
case_70.txt AC 2 ms 256 KB
case_71.txt AC 1 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt AC 1 ms 256 KB