当前位置:网站首页>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
边栏推荐
- Submit several problem records of spark application (sparklauncher with cluster deploy mode)
- 业务系统从Oracle迁移到openGauss数据库的简单记录
- SF smart logistics Campus Technology Challenge (no T4)
- Base dice (dynamic programming + matrix fast power)
- 两个礼拜速成软考中级软件设计师经验
- Acwing - game 55 of the week
- LeetCode 1557. The minimum number of points that can reach all points
- One hundred questions of image processing (1-10)
- 875. Leetcode, a banana lover
- Remove the border when input is focused
猜你喜欢
(lightoj - 1323) billiard balls (thinking)
Detailed explanation of FLV format
我在字节跳动「修电影」
第7章 __consumer_offsets topic
第5章 NameNode和SecondaryNameNode
Tree of life (tree DP)
Discussion on QWidget code setting style sheet
Business system compatible database oracle/postgresql (opengauss) /mysql Trivia
< li> dot style list style type
Advancedinstaller installation package custom action open file
随机推荐
视频压缩编码和音频压缩编码基本原理
JS encapsulates the method of array inversion -- Feng Hao's blog
Codeforces Round #800 (Div. 2)AC
CMake速成
VMware Tools和open-vm-tools的安装与使用:解决虚拟机不全屏和无法传输文件的问题
Codeforces Round #801 (Div. 2)A~C
LeetCode 1020. Number of enclaves
LeetCode 1560. The sector with the most passes on the circular track
Native JS realizes the functions of all selection and inverse selection -- Feng Hao's blog
图像处理一百题(1-10)
Study notes of Tutu - process
第三章 MapReduce框架原理
300th weekly match - leetcode
LeetCode 1636. Sort the array in ascending order by frequency
Advancedinstaller installation package custom action open file
Market trend report, technological innovation and market forecast of desktop electric tools in China
解决Intel12代酷睿CPU单线程只给小核运行的问题
LeetCode 1984. Minimum difference in student scores
(lightoj - 1349) Aladdin and the optimal invitation (greed)
Chapter 7__ consumer_ offsets topic