oj.uz

Submission #142740

# Submission time Handle Problem Language Result Execution time Memory
142740 2019-08-10T16:03:10 Z liwi Parametriziran (COCI19_parametriziran) C++11
99 / 110
 3000 ms 1948 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 50005
#define MAXL 8

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_words,M;
ll res;
bitset<MAXN> m[MAXL][30];

int main(){
	fastio; cin>>num_words>>M;
	for(int i=1; i<=num_words; i++){
		string s; cin>>s;
		bitset<MAXN> t;
		for(int k=0; k<s.size(); k++){
			if(s[k] == '?') continue;
			for(int v=0; v<26; v++)
				if(v != (s[k]-'a'))
					t|=m[k][v];
		}
		res+=(i-1-t.count());
		for(int k=0; k<s.size(); k++){
			if(s[k] == '?') continue;
			m[k][s[k]-'a'][i] = true;
		}
	}
	cout<<res<<endl;
}

Compilation message

parametriziran.cpp: In function 'int main()':
parametriziran.cpp:55:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<s.size(); k++){
                ~^~~~~~~~~
parametriziran.cpp:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<s.size(); k++){
                ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 910 ms 812 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 825 ms 992 KB Output is correct
2 Correct 613 ms 816 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 909 ms 912 KB Output is correct
2 Correct 1384 ms 996 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1161 ms 992 KB Output is correct
2 Correct 767 ms 1032 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1512 ms 1276 KB Output is correct
2 Correct 746 ms 1144 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2648 ms 1408 KB Output is correct
2 Correct 845 ms 1368 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2057 ms 1540 KB Output is correct
2 Correct 612 ms 1476 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2926 ms 1696 KB Output is correct
2 Correct 1698 ms 1596 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2614 ms 1628 KB Output is correct
2 Correct 648 ms 1820 KB Output is correct

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3055 ms 1948 KB Time limit exceeded
2 Halted 0 ms 0 KB -