# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167580 | manh9203 | Vještica (COCI16_vjestica) | C++17 | 134 ms | 1952 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 20;
const int M = 1e5 + 5;
int n,cnt[N][30],dem[M],dp[M];
string s[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i=1;i<=n;i++){
cin >> s[i];
for(int j=0;j<s[i].length();j++){
cnt[i][s[i][j] - 96]++;
}
}
for(int mask = 1; mask < (1 << n); mask++){
for(int i=1;i<=26;i++){
int mn = 1e9;
for(int j=0;j<n;j++){
if((mask >> j) & 1){
mn = min(mn, cnt[j+1][i]);
}
}
dem[mask] += mn;
}
}
dp[0] = 1e9;
for(int mask = 1; mask < (1 << n); mask++){
if(__builtin_popcount(mask) == 1){
for(int i=0;i<n;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |