oj.uz

답안 #316878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316878 2020-10-28T12:20:47 Z ronnith Lozinke (COCI17_lozinke) C++14
10 / 100
 1000 ms 1280 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #warning Check Integer OverFlow
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define de cerr
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (((a)/(__gcd(a,b))) * b)
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define v vector
#define p pair
#define pii p<int,int>
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
ll modF=1e9+7;

/*OUTPUT

*/

int N;
string a[20000];
int val[20000];

struct DSU{
	vi pr;
	DSU(int n){
		pr.assign(n,0);
		rep(i,0,n){
			pr[i] = i;
		}
	}
	int root(int x){
		if(pr[x] == x)return x;
		return pr[x] = root(pr[x]);
	}
	void unite(int x,int y){
		int rx = x;
		int ry = y;
		if(rx == ry)return;
		pr[ry] = rx;
	}
	bool same(int x,int y){
		if(root(x) == root(y)){
			return true;
		}
		return false;
	}
};

bool cmp(string ax,string b){
	return ax.length() > b.length();
}

bool sub(int i,int j){
	int l1 = a[i].length();
	int l2 = a[j].length();
	for(int it = 0;it <= l1 - l2;it ++){
		bool pos = true;
		for(int k = it;k < it + l2;k ++){
			if(a[i][k] != a[j][k - it]){
				pos = false;
			}
		}
		if(pos){
			return true;
		}
	}
	return false;
}

void solve(){
	cin >> N;
	rep(i,0,N){
		cin >> a[i];
		val[i] = 0;
	}
	DSU d(N);
	sort(a,a + N,cmp);
	int ans = 0;
	for(int i = N - 1;i >= 0;i --){
		rep(j,i + 1,N){
			if(a[i] == a[j]){
				ans += 2;
			}
			else if(d.same(i,j)){
				continue;
			}
			else if(sub(i,j)){
				d.unite(i,j);
				val[i] += val[j] + 1;
			}
		}
	}
	for(int i = 0;i < N;i ++){
		ans += val[i];
	}
	cout << ans << ln;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	// cin >> t;
	while(t --){
		solve();
	}
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 896 KB Output isn't correct
2 Incorrect 1 ms 896 KB Output isn't correct
3 Incorrect 1 ms 1024 KB Output isn't correct
4 Incorrect 3 ms 1024 KB Output isn't correct
5 Incorrect 12 ms 1024 KB Output isn't correct
6 Incorrect 27 ms 1024 KB Output isn't correct
7 Incorrect 43 ms 1024 KB Output isn't correct
8 Correct 39 ms 1024 KB Output is correct
9 Execution timed out 1059 ms 1024 KB Time limit exceeded
10 Execution timed out 1004 ms 1272 KB Time limit exceeded
11 Execution timed out 1094 ms 1152 KB Time limit exceeded
12 Execution timed out 1079 ms 1152 KB Time limit exceeded
13 Execution timed out 1084 ms 1280 KB Time limit exceeded
14 Execution timed out 1087 ms 1280 KB Time limit exceeded
15 Execution timed out 1093 ms 1280 KB Time limit exceeded
16 Execution timed out 1094 ms 1280 KB Time limit exceeded
17 Correct 985 ms 1280 KB Output is correct
18 Execution timed out 1052 ms 1280 KB Time limit exceeded
19 Execution timed out 1045 ms 1280 KB Time limit exceeded
20 Execution timed out 1062 ms 1280 KB Time limit exceeded