oj.uz

답안 #142745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
142745 2019-08-10T16:27:36 Z liwi Parametriziran (COCI19_parametriziran) C++11
110 / 110
 1146 ms 2932 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> pref[MAXL][30],suff[MAXL][30];

inline void update(bitset<MAXN> (&bit)[MAXL][30], int k, int l, int idx){
	for(int i=l; i<=26; i+=i&-i)
		bit[k][i][idx] = true;
}

inline bitset<MAXN> query(bitset<MAXN> (&bit)[MAXL][30], int k, int l){
	bitset<MAXN> res;
	for(int i=l; i>0; i-=i&-i)
		res|=bit[k][i];
	return res;
}

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;
			if(s[k]-'a') t|=query(pref,k,s[k]-'a'); //pref[k][s[k]-'a'-1];
			if(s[k]-'a' != 25) t|=query(suff,k,26-(s[k]-'a'+1)); //suff[k][s[k]-'a'+1];
//			for(int v=0; v<26; v++)
//				if(v != (s[k]-'a'))
//					t|=m[k][v];
		}
//		cout<<t<<endl;
		res+=(i-1-t.count());
		for(int k=0; k<s.size(); k++){
			if(s[k] == '?') continue;
			update(pref,k,s[k]-'a'+1,i);
			update(suff,k,26-(s[k]-'a'),i);
//			pref[k][s[k]-'a'][i] = suff[k][s[k]-'a'][i] = true;
		}
//		for(int k=1; k<26; k++){
//			pref[k]|=pref[k-1];
//			suff[26-k-1]|=suff[26-k];
//		}
	}
	cout<<res<<endl;
}

Compilation message

parametriziran.cpp: In function 'int main()':
parametriziran.cpp:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<s.size(); k++){
                ~^~~~~~~~~
parametriziran.cpp:77: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

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 888 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 1116 KB Output is correct
2 Correct 244 ms 1048 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 351 ms 1168 KB Output is correct
2 Correct 505 ms 1300 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 391 ms 1316 KB Output is correct
2 Correct 285 ms 1468 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 1456 KB Output is correct
2 Correct 263 ms 1628 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 890 ms 1820 KB Output is correct
2 Correct 354 ms 1920 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 670 ms 2064 KB Output is correct
2 Correct 253 ms 2060 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 918 ms 2264 KB Output is correct
2 Correct 603 ms 2212 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 843 ms 2392 KB Output is correct
2 Correct 267 ms 2364 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1146 ms 2480 KB Output is correct
2 Correct 739 ms 2932 KB Output is correct