当前位置:网站首页>7-10 punch in strategy
7-10 punch in strategy
2022-07-06 16:44:00 【HBUcs2020】
Lessons of blood and tears , This seems to be the second one who made such a stupid mistake
All variables in the program must apply for space in advance , Otherwise, there will be all kinds of strange mistakes
Like this
The program runs like this
Look at another one more ridiculous :
This is the source code
This is the result of the operation :
The internal data of the array is strangely changed
Finally, it is corrected as follows :
int N,M;
cin>>N>>M;
int a[MAXSIZE][MAXSIZE];
memset(a,0,sizeof(a));
Complete code :
#include<iostream>
#include<vector>
#include<set>
#include<cstring>
//#include<bits/stdc++.h>
using namespace std;
constexpr int MAXSIZE=201;
constexpr int MAXMONEY=0x3f3f3f3f;
int main()
{
int N,M;
cin>>N>>M;
int a[MAXSIZE][MAXSIZE];
memset(a,0,sizeof(a));
int x,y,money;
for(int i=0; i<M; i++)
{
cin>>x>>y>>money;
a[x][y]=money;
a[y][x]=a[x][y];
printf(" 0-4 Whether it is :%d 4-0:%d\n",a[0][4],a[4][0]);
}
//printf("\n0-4 Whether it is :%d 4-0:%d\n",a[0][4],a[4][0]);
int fsum=MAXMONEY,f=0,num=0; // Minimum cost , At least spend the corresponding number
int k;
cin>>k;
for(int i=1; i<=k; i++)
{
int sum=0;//sum: The total cost
int b=1; // Special mark
int n;
cin>>n;
vector<int> s;
set<int> s2;
int d;
cin>>d;
int t=d;
s.push_back(d);
s2.insert(d);
// The first place is special
if(a[0][d])
sum+=a[0][d];
else
{
b=0;
// continue; //??
}
for(int j=1; j<n; j++)
{
cin>>d;
s.push_back(d);
s2.insert(d);
if(a[t][d])
sum+=a[t][d];
else
{
b=0;
continue;
}
t=d; // Be careful
}
// The end point is a special case
if(b==0)
continue;
if(a[0][t])
{
//printf(" Delete %d:%d\n",t,a[t][0]);
sum+=a[0][t];
}
else
{
b=0;
continue;
}
if(s.size()==N&&s2.size()==N)
{
num++;
//printf(" %d \n",i);
if(fsum>sum)
{
fsum=sum;
f=i;
}
}
}
//printf("\n%d\n",a[4][0]);
// Meet the number of strategies num
// Cost the least ( Select the one with the lowest serial number ) Toll f ,fsum
cout<<num<<endl;
cout<<f<<" "<<fsum<<endl;
return 0;
}
Be careful :
1.continue
2.set,vector
边栏推荐
- 音视频开发面试题
- Codeforces Round #801 (Div. 2)A~C
- (lightoj - 1369) answering queries (thinking)
- LeetCode 1020. Number of enclaves
- JS time function Daquan detailed explanation ----- AHAO blog
- 第7章 __consumer_offsets topic
- Market trend report, technological innovation and market forecast of desktop electric tools in China
- Hbuilder x format shortcut key settings
- 提交Spark应用的若干问题记录(sparklauncher with cluster deploy mode)
- Codeforces round 797 (Div. 3) no f
猜你喜欢
Li Kou - 298th weekly match
Chapter 5 namenode and secondarynamenode
视频压缩编码和音频压缩编码基本原理
Installation and use of VMware Tools and open VM tools: solve the problems of incomplete screen and unable to transfer files of virtual machines
LeetCode 1560. The sector with the most passes on the circular track
QT simulates mouse events and realizes clicking, double clicking, moving and dragging
第一章 MapReduce概述
Audio and video development interview questions
JS encapsulates the method of array inversion -- Feng Hao's blog
Chapter 5 detailed explanation of consumer groups
随机推荐
Gridhome, a static site generator that novices must know
新手必会的静态站点生成器——Gridsome
图像处理一百题(11-20)
Raspberry pie 4b64 bit system installation miniconda (it took a few days to finally solve it)
我在字节跳动「修电影」
< li> dot style list style type
LeetCode 1638. Count the number of substrings with only one character difference
Investigation report of bench type Brinell hardness tester industry - market status analysis and development prospect prediction
Hbuilder X格式化快捷键设置
Acwing: the 56th weekly match
视频压缩编码和音频压缩编码基本原理
Codeforces Round #771 (Div. 2)
字节跳动新程序员成长秘诀:那些闪闪发光的宝藏mentor们
业务系统从Oracle迁移到openGauss数据库的简单记录
LeetCode 1552. Magnetic force between two balls
LeetCode 1545. Find the k-th bit in the nth binary string
Research Report on hearing health care equipment industry - market status analysis and development prospect prediction
Installation and use of VMware Tools and open VM tools: solve the problems of incomplete screen and unable to transfer files of virtual machines
Kubernetes集群部署
875. Leetcode, a banana lover