Submission #2763728
Source Code Expand
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>
#include<numeric>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,x) upper_bound(all(a), x) - lower_bound(all(a), x)
#define MCOUNT(a,x,y) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define SUM(a) accumulate(all(a),0)
#define scan(x) scanf("%lld",&x)
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
typedef set<ll> SET;
typedef double D;
const ll inf = 5555555555555555555;
const ll mod = 1000000007;
const D pi = acos(-1);
const D eps = 1e-10;
ll n = 0, m = 0, ans = 0, sum = 0, cnt = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok, flag;
ll dx[5] = { 1,-1,0,0,0 }, dy[5] = { 0,0,1,-1,0 };
ll ddx[9] = { 1,-1,0,0,1,1,-1,-1,0 }, ddy[9] = { 0,0,1,-1,1,-1,1,-1,0 };
#pragma endregion
#define MAX 111111
ll x[111], y[111];
int main(void) {
cin >> n;
rep(i, n) {
scan(x[i]);
scan(y[i]);
}
rep(i, n) FOR(j, i + 1, n) FOR(k, j + 1, n) {
ll x1 = x[j] - x[i];
ll x2 = x[k] - x[i];
ll y1 = y[j] - y[i];
ll y2 = y[k] - y[i];
tmp = abs(x1*y2 - y1 * x2);
if (tmp % 2 == 0 && tmp > 0) ans++;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time
2018-07-01 14:56:22+0900
Task
B - 格子点と整数
User
hide1214
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1762 Byte
Status
AC
Exec Time
2 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:54:12: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scan(x[i]);
^
./Main.cpp:55:12: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scan(y[i]);
^
Judge Result
Set Name
All
Score / Max Score
100 / 100
Status
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
1 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
1 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
1 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
1 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
1 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