1063. Set Similarity (25)
来源:互联网 发布:光荣的愤怒 知乎 编辑:程序博客网 时间:2024/05/07 16:50
#define _CRT_SECURE_NO_WARNINGS
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> *num = new vector<int>[N];
for (int i = 0; i < N; i++)
{
int M;
scanf("%d",&M);
for (int j = 0; j < M; j++)
{
int tmp;
scanf("%d",&tmp);
num[i].push_back(tmp);
}
sort(num[i].begin(), num[i].end());
}
int M;
cin >> M;
for (int i = 0; i < M; i++)
{
int a, b;
scanf("%d %d",&a,&b);
int Nc = 0, Nt = 0;
int i_b = 0, i_a = 0;
int pre_a = -1, pre_b = -1;
while (i_a < num[a - 1].size() && i_b< num[b - 1].size())
{
if (num[a - 1][i_a] > num[b - 1][i_b])
{
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
else if (num[a - 1][i_a] < num[b - 1][i_b])
{
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
else
{
Nc++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
}
while (i_a< num[a - 1].size())
{
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
while (i_b< num[b- 1].size())
{
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
printf("%.1f%%\n",(float)Nc/(float)Nt*100);
}
return 0;
}
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> *num = new vector<int>[N];
for (int i = 0; i < N; i++)
{
int M;
scanf("%d",&M);
for (int j = 0; j < M; j++)
{
int tmp;
scanf("%d",&tmp);
num[i].push_back(tmp);
}
sort(num[i].begin(), num[i].end());
}
int M;
cin >> M;
for (int i = 0; i < M; i++)
{
int a, b;
scanf("%d %d",&a,&b);
int Nc = 0, Nt = 0;
int i_b = 0, i_a = 0;
int pre_a = -1, pre_b = -1;
while (i_a < num[a - 1].size() && i_b< num[b - 1].size())
{
if (num[a - 1][i_a] > num[b - 1][i_b])
{
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
else if (num[a - 1][i_a] < num[b - 1][i_b])
{
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
else
{
Nc++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
}
while (i_a< num[a - 1].size())
{
Nt++;
pre_a = num[a - 1][i_a];
i_a++;
while (i_a < num[a - 1].size() && num[a - 1][i_a] == pre_a)
i_a++;
}
while (i_b< num[b- 1].size())
{
Nt++;
pre_b = num[b - 1][i_b];
i_b++;
while (i_b< num[b - 1].size() && num[b - 1][i_b] == pre_b)
i_b++;
}
printf("%.1f%%\n",(float)Nc/(float)Nt*100);
}
return 0;
}
0 0
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- UVa 10271 - Chopsticks(DP)
- 大数四则运算(高精度)
- 关于文件路径读取的几个方法
- 【80X86汇编语言学习】【字符串处理】字符串操作指令REP
- 走进科学 WAF(Web Appllication Firewall)
- 1063. Set Similarity (25)
- Matplotlib坑爹依赖安装全解
- 044.@interface <>遵守正式协议
- 第一周周报
- android APP优化知识图谱
- leetcode第225题:Implement Stacks using Queues
- Excel导出java实例(有模板)
- Jedis 与 ShardedJedis 设计
- 研究spring原理的心得