7-14 基于词频的文件相似度
STL中set的应用,整行读入,区分单词置入对应的set,对比两个set中的元素,计算相似度。
1.读入的过程中要考虑长度超过10的单词要变为10,不足3的单词要舍去
2.要将大写都写成小写置入set
3.set_union和s2.insert(s1.begin(),s1.end())的速度比较慢
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e6+100;
const int maxe = 1e6+100;
set<string>S[101];
void Solve()
{
int N;
cin>>N;
string s,tem;
for(int i=1;i<=N;i++){
getline(cin,s);
while(s!="#"){
int p=0;
while(p<s.size()){
if(isalpha(s[p])){
string k="";
while(isalpha(s[p])){
k+=s[p];
p++;
if(k.size()==10)break;
}
while(isalpha(s[p]))p++;
if(k.size()>=3){
for(int i=0;i<k.size();i++){
if('A'<=k[i]&&k[i]<='Z'){
k[i]+=32;
}
}
S[i].insert(k);
}
}
p++;
}
getline(cin,s);
}
}
int m;
cin>>m;
int a,b;
for(int i=0;i<m;i++){
cin>>a>>b;
int num1,num2,num3;
num1 = S[a].size();
num2 = S[b].size();
set<string>::iterator it;
num3=0;
for(it=S[a].begin();it!=S[a].end();it++){
if(S[b].count((*it)))
num3++;
}
printf("%.1lf%%\n",num3*100.0/(num1+num2-num3));
}
}
int main()
{
//FILEIN
//FILEOUT
//std::ios::sync_with_stdio(false);
int Case=1,cases;
//cin>>Case;cases=Case;
while(Case--){
//printf("Case #%d:",cases-Case);
Solve();
}
return 0;
}
7-13 PAT排名汇总
结构体排序,注意容易出错的一个地方是如果将学号(13位整数)设置成string类型进行排序和将其设置成long long int类型进行排序是不同的。
7-12 任务调度的合理性
拓扑排序,把0入度的点删除,删掉对应的边,然后在删掉入度为0的点,直到删完或者不能删,如果删完就是可行,否则不可行。
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e5+100;
const int maxe = 1e6+100;
int n;
int mp[105][105];
int in[105];
int vis[105];
void ini(){
CLR(mp);
CLR(vis);
}
void Solve()
{
cin>>n;
ini();
int x,y;
int cnt=0;
for(int i=1;i<=n;i++){
cin>>x;
in[i]+=x;
for(int j=0;j<x;j++){
cin>>y;
mp[y][i]=1;
}
}
int flag;
while(1){
flag = 0;
for(int i=1;i<=n;i++){
if(in[i]==0&&!vis[i]){
vis[i]=1;
flag=1;
for(int j=1;j<=n;j++){
if(mp[i][j]==1){
in[j]--;
}
}
break;
}
}
if(!flag)break;
cnt++;
}
printf("%d\n",cnt==n);
}
int main()
{
//FILEIN
//FILEOUT
//std::ios::sync_with_stdio(false);
int Case=1,cases;
//cin>>Case;cases=Case;
while(Case--){
//printf("Case #%d:",cases-Case);
Solve();
}
return 0;
}
7-11 地下迷宫探索
就是把DFS的每一步都展示出来,因为顺序是固定的,先小后大,注意回溯的时候要把返回的步骤打出来,最后判断一下遍历的点个数是不是总数。
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e6+100;
const int maxe = 1e6+100;
int n,m,s,u,v;
int maze[1001][1001];
int vis[1001];
void dfs(int x){
vis[x]=1;
x==s?printf("%d",x):printf(" %d",x);
for(int i=1;i<=n;i++){
if(maze[x][i]&&!vis[i]){
dfs(i);
printf(" %d",x);
}
}
}
void Solve()
{
cin>>n>>m>>s;
for(int i=0;i<m;i++){
cin>>u>>v;
maze[u][v]=maze[v][u]=1;
}
dfs(s);
bool flag =false;
for(int i=1;i<=n;i++){
if(vis[i]==0){
flag=true;
break;
}
}
if(flag) printf(" 0");
printf("\n");
}
int main()
{
//FILEIN
//FILEOUT
//std::ios::sync_with_stdio(false);
int Case=1,cases;
//cin>>Case;cases=Case;
while(Case--){
//printf("Case #%d:",cases-Case);
Solve();
}
return 0;
}
2016初赛题
7-11 玩转二叉树
已知中序和前序,按照dfs的顺序建立二叉树,然后翻转就是层次遍历从右到左。最好用结构体的方式,否则如果是链的话可能会超出数组的范围(2^30)(当然题目的数据里面很水,没有这样的情况)
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e5+100;
const int maxe = 1e6+100;
int pre[35],mid[35];
int cnt;
struct nodes{
int id,lson,rson;
}node[35];
int dfs(int sta,int fin){
if(sta>fin) return -1;
cnt++;
int st=cnt;
for(int i=sta;i<=fin;i++){
if(mid[i]==pre[st]){
node[pre[st]].lson=dfs(sta,i-1);
node[pre[st]].rson=dfs(i+1,fin);
return pre[st];
}
}
}
int ss;
void print(int x){
queue<int>Q;
Q.push(x);
while(!Q.empty()){
int a=Q.front();
Q.pop();
if(ss==0){printf("%d",a);ss++;}
else printf(" %d",a);
if(node[a].rson!=-1)Q.push(node[a].rson);
if(node[a].lson!=-1)Q.push(node[a].lson);
}
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>mid[i];
for(int i=1;i<=n;i++) cin>>pre[i];
if(n==1){printf("%d\n",mid[1]);return 0;}
for(int i=1;i<=n;i++){
node[i].id=i;
node[i].lson=node[i].rson=0;
}
cnt=0;
int x=dfs(1,n);
ss=0;
print(x);
printf("\n");
}
/*
3 2 1
1 2 1
1 3 1
2 3
*/
7-12 关于堆的判断
建立小顶堆,建立的过程中要往根更新小值。其中容易搞错的一个地方是:只有同一个父亲节点的两个子节点才是siblings.
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e4+100;
const int maxe = 1e6+100;
int Tree[maxn];
void update(int i)
{
if(i==1)return;
if(i == 1) return ;
while(i != 1) {
if(Tree[i] < Tree[i/2]) {
swap(Tree[i],Tree[i/2]);
i = i / 2;
} else break;
}
}
string s;
int n,m,x;
void get(int num1,int num2,int &index1,int &index2)
{
for(int i=1; i<=n; i++){
if(Tree[i]==num1) index1=i;
if(Tree[i]==num2) index2=i;
}
}
void Solve()
{
cin>>n>>m;
for(int i=1; i<=n; i++){
cin>>Tree[i];
update(i);
}
for(int i=0; i<m; i++){
int flag=0;
int num1,num2;
char c[100];
scanf("%d%s",&num1,c);
if(strcmp(c,"and")==0) flag=2;
else {
scanf("%s",c);
if(strcmp(c,"a")==0)flag=4;
else {
scanf("%s",c);
if(strcmp(c,"root")==0)flag=1;
else flag=3;
}
}
if(flag==1){
printf("%c\n",Tree[1]==num1?'T':'F');
}
if(flag==2)
{
int index1,index2;
scanf("%d%s%s",&num2,c,c);
get(num1,num2,index1,index2);
printf("%c\n",index1/2==index2/2?'T':'F');
}
if(flag==3)
{
int index1,index2;
scanf("%s%d",c,&num2);
get(num1,num2,index1,index2);
printf("%c\n",index1==index2/2?'T':'F');
}
if(flag==4)
{
int index1,index2;
scanf("%s%s%d",c,c,&num2);
get(num1,num2,index1,index2);
printf("%c\n",index2==index1/2?'T':'F');
}
}
}
int main()
{
//FILEIN
//FILEOUT
//std::ios::sync_with_stdio(false);
int Case=1,cases;
//cin>>Case;cases=Case;
while(Case--)
{
//printf("Case #%d:",cases-Case);
Solve();
}
return 0;
}
/*
5 4
-46 -23 -26 -24 -10
-24 is the root
-26 and -23 are siblings
-46 is the parent of -23
-23 is a child of -10
*/
7-10 排座位
并查集+图,并查集建立朋友集合,注意的是:如果两个人A,B是敌人,遍历A,B的朋友看是否有属于统一朋友集合的两个人,这样才能输出”OK but…”
/********************************
Auther: jianwei
blog : http://blog.csdn.net/jianwei2016
********************************/
#include<bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
#define CLR(x) memset(x,0,sizeof(x))
#define MEM(x) memset(x,-1,sizeof(x))
#define PB(x) push_back(x)
#define PF(x) push_front(x)
#define For(x,a,b) for(int x=a;x<b;x++)
#define rFor(x,a,b) for(int x=a;x>b;x--)
#define FOR(x,a,b) for(int x=a;x<=b;x++)
#define rFOR(x,a,b) for(int x=a;x>=b;x--)
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define PLI pair<ll,int>
#define PIL pair<int,ll>
#define mp(x,y) make_pair(x,y)
#define lowbit(x) (x&(-x))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
const double eps = 1e-6;
const ll mod = 1e9+7;
const int maxn = 1e5+100;
const int maxe = 1e6+100;
struct node{
int to;
int link;
node(int to=0,int link=0):to(to),link(link){};
};
int pre[105];
vector<node>V[105];
int Find(int x){
return pre[x]==x?x:pre[x]=Find(pre[x]);
}
void Union(int u,int v){
int fu=Find(u);
int fv=Find(v);
if(fu!=fv){
if(fu<fv){
pre[fv]=fu;
}
else{
pre[fu]=fv;
}
}
}
int main()
{
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
pre[i]=i;
}
for(int i=0;i<m;i++){
int u,v,link;
cin>>u>>v>>link;
node a(u,link);
node b(v,link);
V[u].PB(b);
V[v].PB(a);
if(link==1){
Union(u,v);
}
}
for(int j=0;j<k;j++){
int u,v;
cin>>u>>v;
int flag=0;
for(int i=0;i<V[u].size();i++){
if(V[u][i].to==v&&V[u][i].link==-1){
flag=1;
int f=0;
for(int k=0;k<V[u].size();k++){
for(int p=0;p<V[v].size();p++){
node x1=V[u][k],x2=V[v][p];
if(x1.link==1&&x2.link==1){
if(Find(x1.to)==Find(x2.to)){
f=1;
printf("OK but...\n");
break;
}
}
}
if(f)break;
}
if(!f)printf("No way\n");
}
if(V[u][i].to==v&&V[u][i].link==1){
flag=1;
printf("No problem\n");
break;
}
}
if(flag==0){
if(Find(u)==Find(v)){
printf("No problem\n");
}
else printf("OK\n");
}
}
}
/*
3 2 1
1 2 1
1 3 1
2 3
*/