QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#234876#5499. Aliasesraztun#AC ✓1044ms25096kbC++201005b2023-11-02 00:43:282023-11-02 00:43:28

Judging History

你现在查看的是最新测评结果

  • [2023-11-02 00:43:28]
  • 评测
  • 测评结果:AC
  • 用时:1044ms
  • 内存:25096kb
  • [2023-11-02 00:43:28]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int zz; cin>>zz;
	while (zz--)
	{
		int n; cin>>n;
		vector<string>a(n), b(n);
		for (int i=0; i<n; i++)
		{
			cin>>a[i]>>b[i];
		}
		int ans=to_string(n-1).size(), a1=0, a2=0, a3=ans;
		for (int x=0; x<ans; x++)
		{
			for (int y=0; x+y<ans; y++)
			{
				unordered_map<string, int>mapa;
				for (int i=0; i<n; i++)
				{
					string pom="";
					for (int j=0; j<min(x, (int)a[i].size()); j++) pom+=a[i][j];
					for (int j=0; j<min(y, (int)b[i].size()); j++) pom+=b[i][j];
					mapa[pom]++;
				}
				int c=0;
				for (auto i : mapa)
				{
					//~ cout<<x<<" "<<y<<" "<<i.first<<" "<<i.second<<"\n";
					if (i.second>1) c=max(c, (int)to_string(i.second-1).size());
					if (x+y+c >= ans) break;
				}
				if (x+y+c < ans && x+y+c)
				{
					ans=x+y+c;
					a1=x;
					a2=y;
					a3=c;
				}
			}
		}
		cout<<a1<<" "<<a2<<" "<<a3<<"\n";
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3876kb

input:

1
11
sven eriksson
erik svensson
sven svensson
erik eriksson
bjorn eriksson
bjorn svensson
bjorn bjornsson
erik bjornsson
sven bjornsson
thor odinsson
odin thorsson

output:

0 0 2

result:

ok correct! (1 test case)

Test #2:

score: 0
Accepted
time: 10ms
memory: 5140kb

input:

6
1
g u
14643
gj ek
hc bi
hi ke
ab ij
hk cj
ha bi
ag fe
eb ej
hd ei
bf gj
ke dd
ib jd
id jb
gd ei
cj bi
bi hg
ic dh
ke gk
af eg
fg dd
fe fa
be ge
hf kj
ih ci
gg jf
ed dd
eh gi
cc kd
ka fd
af gb
ka fe
ja ed
bc hi
eg cf
gg ff
kf gf
ii ch
hh ec
ei ec
cd gc
bh hb
dd id
ce bk
ib ic
bf kk
gh cd
hb he
if g...

output:

0 0 1
0 0 5
0 1 1
1 0 2
1 1 1
2 0 1

result:

ok correct! (6 test cases)

Test #3:

score: 0
Accepted
time: 42ms
memory: 6216kb

input:

6
5000
dpbcebnavonpwlkermqftinonhckqynyxfwsybsalgmpqmedykqeunbolxhtcnrvbiqrjgziptkqgbsxrprapfzjxefiioecsacujyuhvsapywqohliffaqsbupnocesbgqutaanduiztwwqulwvrx dyearafwtdkifljtvcryeyfzgqghjwhuycusqkxngmanxxjhyqaethbfoqaigbbjuutwzzazsgcguaasrrrzsapcuhvzzjllatjqtxzrotdpcrrdogfwoonxjwisdwhqntlhqpflxvcido...

output:

0 0 4
0 1 3
1 1 2
2 0 2
1 2 1
3 0 1

result:

ok correct! (6 test cases)

Test #4:

score: 0
Accepted
time: 1044ms
memory: 19264kb

input:

6
113503
hxihfx mrqehftb
oqmcc bwrbqomg
dokyjc kuaiu
hhfubp aleme
xcnbe shxaqrf
kzmqym geclklta
jnxjq nppjx
xeloxixa owsxnnj
pzlvbyuk leioq
xipez hoxgsml
esujubw cwwzpei
fekvoee vbxlts
xjhcrkx qicmbmen
rskvnrcx mpzpvvye
lkkmkstn wlptoh
wqgvr qbryq
cqxydbr fzdxdrv
wzofngxt keqwwhdl
fkomzb sckpev
geqe...

output:

4 0 1
2 2 1
1 3 1
3 0 2
1 2 2
1 1 3

result:

ok correct! (6 test cases)

Test #5:

score: 0
Accepted
time: 687ms
memory: 25096kb

input:

6
1331
hidkxivneczxfctnobbqpxsgneaivgbodiejoqgbdthwsdsfzkxcdtzumcfdoawihskkwkehjdezgazzphrnkgncimntusqjqwimwbsztbzceqnwmnzzezwzazakknfwvdsyglpplwgnhwcgpriuwdmbvvlxaoruuuugamntnuqlvslsgvehhegjqpkcskonosndngfkokjcrqewtzzmypimrsoqqffwwzgzwhgfrrxmtptzfnretnoqjprpgqdhxcrccphsdmouuuidojxcyiknpfrrygjgwgwkb...

output:

1 2 0
3 1 0
4 1 0
2 3 0
0 5 0
0 0 6

result:

ok correct! (6 test cases)