제출 #1204581

#제출 시각아이디문제언어결과실행 시간메모리
1204581FaresSTH9월 (APIO24_september)C++20
0 / 100
0 ms524 KiB
#include"bits/stdc++.h"
using namespace std;
using ll=long long;
#define S second
#define F first
const ll b=277,md=1e9+277;
int solve(int n,int m,vector<int>f,vector<vector<int>>s){
    ll res=0,h[m]={},pw[n];
    pw[0]=1;
    for(int i=1;i<n;i++)pw[i]=pw[i-1]*b%md;
    for(int i=0;i<n-1;i++){
        bool f=1;
        for(int j=0;j<m;j++){
            h[j]=(h[j]+pw[s[j][i]])%md;
            if(h[j]!=h[0])f=0;
        }
        res+=f;
    }
    return res;
}
// int main(){
    // cout<<solve(3,1,{-1,0,0},{{1,2}});
    // cout<<'\n'<<solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}});
// }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...