# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575668 | 2022-06-11T07:37:18 Z | AGE | Parametriziran (COCI19_parametriziran) | C++14 | 3000 ms | 34624 KB |
#include<bits/stdc++.h> #define F first #define S second #define int long long #define pb push_back using namespace std; const int N=1e6,M=2e3,mod=1e9+7; string s[N]; map<string,int>mp; int cnt[N][27]; main() { int n,m; cin>>n>>m; for(int i=0;i<n;i++) cin>>s[i]; int ans=n*(n-1); for(int i=0;i<n;i++){ if(s[i][0]!='?') cnt[0][s[i][0]-'a']++; if(s[i][1]!='?') cnt[1][s[i][1]-'a']++; } int sum0=0; for(int i=0;i<26;i++) sum0+=cnt[0][i]; for(int i=0;i<n;i++) if(s[i][0]!='?') ans-=(sum0-cnt[0][s[i][0]-'a']); int sum1=0; for(int i=0;i<26;i++) sum1+=cnt[1][i]; for(int i=0;i<n;i++) if(s[i][1]!='?') ans-=(sum1-cnt[1][s[i][1]-'a']); int cntt=0; for(int i=0;i<n;i++){ if(s[i][0]!='?'&&s[i][1]!='?') cntt++,mp[s[i]]++; } for(int i=0;i<n;i++){ if(s[i][0]=='?'||s[i][1]=='?') continue; for(char x='a';x<='z';x++){ string ss; ss.clear(); ss+=x; for(char y='a';y<='z';y++){ ss+=y; if(x!=s[i][0]&&y!=s[i][1]) ans+=mp[ss]; } } } cout<<ans/2<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3064 ms | 31728 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1212 ms | 31812 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 832 ms | 31836 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1465 ms | 32632 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1219 ms | 32440 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2987 ms | 34532 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1558 ms | 33368 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2800 ms | 34624 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1967 ms | 33776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2731 ms | 34600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |