Submission #1564022
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 998244353ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;
int n;
pii pts[252];
ll bin[252];
int cross(pii a,pii b){
return a.first*b.second - a.second*b.first;
}
int sp(pii a,pii b,pii c){
pii x = pii(b.first-a.first, b.second-a.second);
pii y = pii(c.first-a.first, c.second-a.second);
return cross(x,y);
}
int main(){
scanf("%d",&n);
REP(i,n){
int x,y;
scanf("%d%d",&x,&y);
pts[i] = pii(x,y);
}
bin[0] = 1;
FOR(i,1,252)bin[i] = bin[i-1]*2%MOD;
ll ans = bin[n];
FOR(i,0,n)FOR(j,i+1,n){
int x = 0;
FOR(k,j+1,n){
if(sp(pts[i],pts[j],pts[k]) == 0){
x++;
}
}
ans -= bin[x];
}
ans -= n;
ans -= 1;
printf("%lld\n",FIX(ans));
return 0;
}
Submission Info
Submission Time
2017-09-02 22:55:11+0900
Task
E - ConvexScore
User
rickytheta
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1565 Byte
Status
AC
Exec Time
3 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:51:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
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
2 ms
256 KB
1_006.txt
AC
1 ms
256 KB
1_007.txt
AC
2 ms
256 KB
1_008.txt
AC
2 ms
256 KB
1_009.txt
AC
2 ms
256 KB
1_010.txt
AC
1 ms
256 KB
1_011.txt
AC
2 ms
256 KB
1_012.txt
AC
2 ms
256 KB
1_013.txt
AC
2 ms
256 KB
1_014.txt
AC
1 ms
256 KB
1_015.txt
AC
2 ms
256 KB
1_016.txt
AC
1 ms
256 KB
1_017.txt
AC
3 ms
256 KB
1_018.txt
AC
3 ms
256 KB
1_019.txt
AC
3 ms
256 KB
1_020.txt
AC
3 ms
256 KB
1_021.txt
AC
3 ms
256 KB
1_022.txt
AC
3 ms
256 KB
1_023.txt
AC
3 ms
256 KB
1_024.txt
AC
3 ms
256 KB
1_025.txt
AC
3 ms
256 KB
1_026.txt
AC
3 ms
256 KB
1_027.txt
AC
3 ms
256 KB
1_028.txt
AC
3 ms
256 KB
1_029.txt
AC
3 ms
256 KB
1_030.txt
AC
3 ms
256 KB
1_031.txt
AC
3 ms
256 KB
1_032.txt
AC
3 ms
256 KB
1_033.txt
AC
3 ms
256 KB
1_034.txt
AC
3 ms
256 KB
1_035.txt
AC
3 ms
256 KB