当前位置:网站首页>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
边栏推荐
- 原生js实现全选和反选的功能 --冯浩的博客
- SQL快速入门
- Summary of FTP function implemented by qnetworkaccessmanager
- LeetCode 1447. Simplest fraction
- Business system compatible database oracle/postgresql (opengauss) /mysql Trivia
- Kubernetes cluster deployment
- SF smart logistics Campus Technology Challenge (no T4)
- (lightoj - 1236) pairs forming LCM (prime unique decomposition theorem)
- ffmpeg命令行使用
- 图像处理一百题(11-20)
猜你喜欢
Two weeks' experience of intermediate software designer in the crash soft exam
300th weekly match - leetcode
我在字节跳动「修电影」
< li> dot style list style type
Hbuilder X格式化快捷键设置
Simply try the new amp model of deepfacelab (deepfake)
使用jq实现全选 反选 和全不选-冯浩的博客
VMware Tools和open-vm-tools的安装与使用:解决虚拟机不全屏和无法传输文件的问题
LeetCode 1584. Minimum cost of connecting all points
Tree of life (tree DP)
随机推荐
第三章 MapReduce框架原理
LeetCode 1020. Number of enclaves
Research Report on market supply and demand and strategy of Chinese table lamp industry
我在字节跳动「修电影」
业务系统兼容数据库Oracle/PostgreSQL(openGauss)/MySQL的琐事
Codeforces Global Round 19
Two weeks' experience of intermediate software designer in the crash soft exam
LeetCode 1447. Simplest fraction
(lightoj - 1369) answering queries (thinking)
Solve the problem of intel12 generation core CPU [small core full, large core onlookers] (win11)
第7章 __consumer_offsets topic
【锟斤拷】的故事:谈谈汉字编码和常用字符集
MP4格式详解
QT simulates mouse events and realizes clicking, double clicking, moving and dragging
简单尝试DeepFaceLab(DeepFake)的新AMP模型
Codeforces Round #771 (Div. 2)
Base dice (dynamic programming + matrix fast power)
LeetCode 1560. The sector with the most passes on the circular track
第一章 MapReduce概述
Sublime text code formatting operation