Submission #1560563


Source Code Expand

#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <deque> 
#include <queue> 
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <functional> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <cctype> 
#include <string> 
#include <cstring> 
#include <ctime> 

using namespace std;

#define _int64 long long
#define mo 998244353

int used[210][210];
int x[210];
int y[210];
int pow2[210];

int main()
{
  int i,j,k,n,ans,o,p,b1;
  vector<int> q;
  pow2[0]=1;
  for (i=1;i<210;i++)
  {
    pow2[i]=pow2[i-1]+pow2[i-1];
    pow2[i]%=mo;
  }
  scanf("%d",&n);
  for (i=0;i<n;i++)
    scanf("%d%d",&x[i],&y[i]);
  ans=pow2[n];
  ans--;
  ans-=n;
  ans+=mo;
  ans%=mo;
  memset(used,0,sizeof(used));
  for (i=0;i<n;i++)
    for (j=i+1;j<n;j++)
      if (used[i][j]==0)
      {
        q.clear();
        q.push_back(i);
        q.push_back(j);
        for (k=j+1;k<n;k++)
        {
          b1=0;
          if ((x[i]==x[j])&&(x[k]==x[i])) b1=1;
          else if ((y[i]==y[j])&&(y[k]==y[i])) b1=1;
          else
          {
            if ((y[j]-y[i])*(x[k]-x[i])==(y[k]-y[i])*(x[j]-x[i])) b1=1;
          }
          if (b1==1) q.push_back(k);
        }
        ans-=pow2[q.size()];
        ans+=q.size();
        ans++;
        ans%=mo;
        ans+=mo;
        ans%=mo;
        for (o=0;o<q.size();o++)
          for (p=o+1;p<q.size();p++)
            used[q[o]][q[p]]=1;
      }
  printf("%d\n",ans);
  return 0;
}

Submission Info

Submission Time
Task E - ConvexScore
User liympanda
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1657 Byte
Status AC
Exec Time 5 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:46:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&x[i],&y[i]);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 36
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 384 KB
0_001.txt AC 1 ms 384 KB
0_002.txt AC 1 ms 384 KB
1_003.txt AC 1 ms 384 KB
1_004.txt AC 1 ms 384 KB
1_005.txt AC 2 ms 384 KB
1_006.txt AC 1 ms 384 KB
1_007.txt AC 2 ms 384 KB
1_008.txt AC 2 ms 384 KB
1_009.txt AC 2 ms 384 KB
1_010.txt AC 1 ms 384 KB
1_011.txt AC 3 ms 384 KB
1_012.txt AC 3 ms 384 KB
1_013.txt AC 2 ms 384 KB
1_014.txt AC 1 ms 384 KB
1_015.txt AC 1 ms 384 KB
1_016.txt AC 1 ms 384 KB
1_017.txt AC 5 ms 384 KB
1_018.txt AC 5 ms 384 KB
1_019.txt AC 3 ms 384 KB
1_020.txt AC 3 ms 384 KB
1_021.txt AC 4 ms 384 KB
1_022.txt AC 4 ms 384 KB
1_023.txt AC 5 ms 384 KB
1_024.txt AC 5 ms 384 KB
1_025.txt AC 4 ms 384 KB
1_026.txt AC 4 ms 384 KB
1_027.txt AC 1 ms 384 KB
1_028.txt AC 1 ms 384 KB
1_029.txt AC 4 ms 384 KB
1_030.txt AC 5 ms 384 KB
1_031.txt AC 5 ms 384 KB
1_032.txt AC 5 ms 384 KB
1_033.txt AC 5 ms 384 KB
1_034.txt AC 5 ms 384 KB
1_035.txt AC 4 ms 384 KB