Submission #1756912
Source Code Expand
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>
#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>
#define cauto const auto&
#else
#endif
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define MOD 998244353LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
// Mod int
// const int MOD = 1000000007;
struct mint{
ll x;
mint():x(0){}
mint(ll x):x((x%MOD+MOD)%MOD){}
mint operator+=(const mint& a){ if((x+=a.x)>=MOD) x-=MOD; return *this;}
mint operator-=(const mint& a){ if((x+=MOD-a.x)>=MOD) x-=MOD; return *this;}
mint operator*=(const mint& a){ (x*=a.x)%=MOD; return *this;}
mint operator+(const mint& a)const{ return mint(*this) += a;}
mint operator-(const mint& a)const{ return mint(*this) -= a;}
mint operator*(const mint& a)const{ return mint(*this) *= a;}
bool operator==(const mint& a)const{ return x == a.x;}
friend ostream& operator<<(ostream& os, const mint& mi)
{
os << mi.x;
return os;
}
};
mint comb[300][300];
void mainmain(){
int n;
cin>>n;
vector<pii> v(n);
rep(i,n){
cin>>v[i].fi>>v[i].se;
}
rep(i,300){
comb[i][0] = comb[i][i] = mint(1);
rep(j,i-1){
comb[i][j+1] = comb[i-1][j]+comb[i-1][j+1];
}
}
set<pii> used;
mint ans;
rep(i,n){
rep(j,i){
pii a(v[i].fi-v[j].fi, v[i].se-v[j].se);
int t = __gcd(a.fi, a.se);
a.fi /= t;
a.se /= t;
if(used.find(a)!=used.end()) continue;
used.insert(a);
int cnt = 1;
rep(k,n){
if(i==k) continue;
pii b(v[i].fi-v[k].fi, v[i].se-v[k].se);
int t = __gcd(b.fi, b.se);
b.fi /= t;
b.se /= t;
if(a==b) cnt++;
}
rep(k,3,cnt+1){
ans -= comb[cnt][k];
}
}
}
rep(i,3,n+1){
ans += comb[n][i];
}
cout<<ans<<endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(20);
mainmain();
}
Submission Info
Submission Time |
|
Task |
E - ConvexScore |
User |
j_gui0121 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3710 Byte |
Status |
WA |
Exec Time |
157 ms |
Memory |
1920 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
2 ms |
1024 KB |
0_001.txt |
AC |
2 ms |
896 KB |
0_002.txt |
AC |
2 ms |
1024 KB |
1_003.txt |
AC |
2 ms |
896 KB |
1_004.txt |
AC |
2 ms |
1024 KB |
1_005.txt |
AC |
41 ms |
1280 KB |
1_006.txt |
AC |
2 ms |
1024 KB |
1_007.txt |
WA |
3 ms |
1024 KB |
1_008.txt |
WA |
3 ms |
1024 KB |
1_009.txt |
WA |
4 ms |
1024 KB |
1_010.txt |
WA |
3 ms |
1024 KB |
1_011.txt |
WA |
16 ms |
1152 KB |
1_012.txt |
WA |
12 ms |
1152 KB |
1_013.txt |
WA |
9 ms |
1280 KB |
1_014.txt |
WA |
2 ms |
1024 KB |
1_015.txt |
AC |
2 ms |
1024 KB |
1_016.txt |
AC |
2 ms |
1024 KB |
1_017.txt |
AC |
156 ms |
1920 KB |
1_018.txt |
AC |
157 ms |
1920 KB |
1_019.txt |
WA |
4 ms |
1024 KB |
1_020.txt |
WA |
4 ms |
1024 KB |
1_021.txt |
WA |
5 ms |
1024 KB |
1_022.txt |
WA |
7 ms |
1024 KB |
1_023.txt |
WA |
27 ms |
1280 KB |
1_024.txt |
WA |
17 ms |
1280 KB |
1_025.txt |
WA |
23 ms |
1536 KB |
1_026.txt |
WA |
36 ms |
1536 KB |
1_027.txt |
AC |
2 ms |
1024 KB |
1_028.txt |
AC |
2 ms |
1024 KB |
1_029.txt |
AC |
112 ms |
1664 KB |
1_030.txt |
WA |
138 ms |
1920 KB |
1_031.txt |
WA |
138 ms |
1920 KB |
1_032.txt |
WA |
135 ms |
1920 KB |
1_033.txt |
WA |
140 ms |
1920 KB |
1_034.txt |
WA |
57 ms |
1536 KB |
1_035.txt |
WA |
5 ms |
1024 KB |