Submission #1564582
Source Code Expand
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;
#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll>
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b)
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b)
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
struct modll {
static const ll MODVAL;
ll val;
modll() : val(0) {}
modll(ll v) : val(v) { normalize(); }
void normalize() { val = (val+MODVAL) % MODVAL; }
modll operator+ (ll v) { return modll(val+v); }
modll& operator+=(ll v) { val+=v; normalize(); return *this; }
modll operator- (ll v) { return modll(val-v); }
modll& operator-=(ll v) { val-=v; normalize(); return *this; }
modll operator* (ll v) { return modll(val*v); }
modll& operator*=(ll v) { val*=v; normalize(); return *this; }
modll operator^ (ll e) { modll x(val); modll v(1); for(;e;x=x*x,e>>=1) if(e&1) v = v * x; return v; } // pow
modll inv() { modll x(val); return x^(MODVAL-2); } // MODVAL must be prime number when use this!
static modll inv(ll v) { return modll(v).inv(); }
operator ll() { return val; }
};
const ll modll::MODVAL = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
while(cin>>N) {
VI X(N), Y(N);
REP(i, N) cin>>X[i]>>Y[i];
modll ans = (modll(2)^N) - (N*(N-1)/2 + N + 1);
// DD(ans);
VVI done(N, VI(N));
REP(i, N) REP(j, i) if(!done[i][j]) {
VI onLine = {i, j};
REP(k, N) if(k!=i && k!=j && (X[k]-X[i])*(Y[j]-Y[i])-(Y[k]-Y[i])*(X[j]-X[i])==0) onLine.PB(k);
ll r = onLine.size();
REP(a, r) REP(b, r) done[onLine[a]][onLine[b]]=1;
// DD(onLine);
if(r>=3) ans -= (modll(2)^r) - (1 + r + (r*(r-1)/2));
}
cout<<ans<<endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
E - ConvexScore |
User |
kojingharang |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4035 Byte |
Status |
AC |
Exec Time |
11 ms |
Memory |
768 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 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 |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
1_003.txt |
AC |
1 ms |
256 KB |
1_004.txt |
AC |
1 ms |
256 KB |
1_005.txt |
AC |
4 ms |
384 KB |
1_006.txt |
AC |
1 ms |
256 KB |
1_007.txt |
AC |
4 ms |
512 KB |
1_008.txt |
AC |
3 ms |
384 KB |
1_009.txt |
AC |
4 ms |
384 KB |
1_010.txt |
AC |
2 ms |
384 KB |
1_011.txt |
AC |
5 ms |
384 KB |
1_012.txt |
AC |
6 ms |
512 KB |
1_013.txt |
AC |
4 ms |
384 KB |
1_014.txt |
AC |
1 ms |
256 KB |
1_015.txt |
AC |
2 ms |
512 KB |
1_016.txt |
AC |
1 ms |
384 KB |
1_017.txt |
AC |
11 ms |
640 KB |
1_018.txt |
AC |
11 ms |
640 KB |
1_019.txt |
AC |
7 ms |
640 KB |
1_020.txt |
AC |
6 ms |
640 KB |
1_021.txt |
AC |
7 ms |
640 KB |
1_022.txt |
AC |
9 ms |
640 KB |
1_023.txt |
AC |
10 ms |
640 KB |
1_024.txt |
AC |
10 ms |
640 KB |
1_025.txt |
AC |
9 ms |
640 KB |
1_026.txt |
AC |
9 ms |
768 KB |
1_027.txt |
AC |
2 ms |
640 KB |
1_028.txt |
AC |
2 ms |
640 KB |
1_029.txt |
AC |
9 ms |
640 KB |
1_030.txt |
AC |
11 ms |
640 KB |
1_031.txt |
AC |
11 ms |
640 KB |
1_032.txt |
AC |
11 ms |
640 KB |
1_033.txt |
AC |
11 ms |
640 KB |
1_034.txt |
AC |
11 ms |
640 KB |
1_035.txt |
AC |
7 ms |
640 KB |