Codeforces 183B - Zoo 暴力、计算几何

连续出了3个锅：nm不分、访问内存前不检查地址偏移、分类不当。

#include<bits/stdc++.h>
using namespace std;
#define ll long long


int maxans[1000005];
ll x[255];
ll y[255];

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%lld%lld",&x[i],&y[i]);
    }

    for(int i=1;i<=n;i++){
        maxans[i]=1;
    }

    for(int i=0;i<m;i++){
        for(int j=i+1;j<m;j++){
            //cout<<i<<" "<<j<<endl;
            ll t=0;
            if(y[i]!=y[j]){
                if((((x[i]-x[j])*y[i])%(y[i]-y[j]))==0){
                    t=x[i]-(((x[i]-x[j])*y[i])/(y[i]-y[j]));
                    if(t>=1&&t<=n){
                        int cur=2;
                        for(int k=j+1;k<m;k++){
                            //cout<<i<<" "<<j<<" "<<k<<endl;
                            if(((y[i]-y[j])*(x[i]-x[k]))==((y[i]-y[k])*(x[i]-x[j]))){
                                cur++;
                            }
                        }
                        maxans[t]=max(maxans[t],cur);
                    }
                }
            }
            else{
                t=x[i];
                if(t>=1&&t<=n){
                    int cur=1;
                    for(int k=i+1;k<m;k++){
                        //cout<<i<<" "<<j<<" "<<k<<endl;
                        if(x[k]==t){
                            cur++;
                        }
                    }
                    maxans[t]=max(maxans[t],cur);
                }
            }
        }
    }

    ll sum=0;
    for(int i=1;i<=n;i++){
        sum+=maxans[i];
    }

    printf("%lld\n",sum);
}