有没有大佬帮忙改下代码？
2024-06-30 19:39:10
发布于：浙江
55阅读
0回复
0点赞
就A+B Problem,为什么dfs错了？
为什么，为什么我dfs不能过A+B？？？
代码如下，自测无误：
#pragma G++ optimize(1)
#pragma G++ optimize(2)
#pragma G++ optimize(3)
#pragma G++ optimize("Ofast")
#pragma G++ optimize("inline")
#pragma G++ optimize("-fgcse")
#pragma G++ optimize("-fgcse-lm")
#pragma G++ optimize("-fipa-sra")
#pragma G++ optimize("-ftree-pre")
#pragma G++ optimize("-ftree-vrp")
#pragma G++ optimize("-fpeephole2")
#pragma G++ optimize("-ffast-math")
#pragma G++ optimize("-fsched-spec")
#pragma G++ optimize("unroll-loops")
#pragma G++ optimize("-falign-jumps")
#pragma G++ optimize("-falign-loops")
#pragma G++ optimize("-falign-labels")
#pragma G++ optimize("-fdevirtualize")
#pragma G++ optimize("-fcaller-saves")
#pragma G++ optimize("-fcrossjumping")
#pragma G++ optimize("-fthread-jumps")
#pragma G++ optimize("-funroll-loops")
#pragma G++ optimize("-fwhole-program")
#pragma G++ optimize("-freorder-blocks")
#pragma G++ optimize("-fschedule-insns")
#pragma G++ optimize("inline-functions")
#pragma G++ optimize("-ftree-tail-merge")
#pragma G++ optimize("-fschedule-insns2")
#pragma G++ optimize("-fstrict-aliasing")
#pragma G++ optimize("-fstrict-overflow")
#pragma G++ optimize("-falign-functions")
#pragma G++ optimize("-fcse-skip-blocks")
#pragma G++ optimize("-fcse-follow-jumps")
#pragma G++ optimize("-fsched-interblock")
#pragma G++ optimize("-fpartial-inlining")
#pragma G++ optimize("no-stack-protector")
#pragma G++ optimize("-freorder-functions")
#pragma G++ optimize("-findirect-inlining")
#pragma G++ optimize("-frerun-cse-after-loop")
#pragma G++ optimize("inline-small-functions")
#pragma G++ optimize("-finline-small-functions")
#pragma G++ optimize("-ftree-switch-conversion")
#pragma G++ optimize("-foptimize-sibling-calls")
#pragma G++ optimize("-fexpensive-optimizations")
#pragma G++ optimize("-funsafe-loop-optimizations")
#pragma G++ optimize("inline-functions-called-once")
#pragma G++ optimize("-fdelete-null-pointer-checks"
#include<bits/stdc++.h>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>
#include <any>
#define int long long
using namespace std;
std::random_device rd;
unsigned int seed = rd();
std::mt19937 engine(seed);
char *p1, *p2, buf[100000];
#define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
int read() {
int x = 0, f = 1;
char ch = nc();
while (ch < 48 || ch > 57) {
if (ch == '-')
f = -1;
ch = nc();
}
while (ch >= 48 && ch <= 57)
x = x * 10 + ch - 48, ch = nc();
return x * f;
}
void write(int x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
return;
}
int sum,nextt[4][2]={1,0,0,1,-1,0,0,-1};
int mp[100][100];
bool vis[100][100];
void dfs(int x, int y) {
if(vis[x][y]==1)return;
// cout<<x<<" "<<y<<endl;
vis[x][y]=1;
for(int i=0;i<4;i++){
int dx=x+nextt[i][0],dy=y+nextt[i][1];
if(dx>=1&&dx<=100&&dy>=1&&dy<=100&&vis[dx][dy]==false){
// vis[dx][dy]=1;
sum+=mp[dx][dy];
dfs(dx,dy);
// vis[dx][dy]=0;
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int x,y;
cin>>x>>y;
mp[rand() % 100][rand() % 100] = x;
mp[rand()*10086 % 100][rand()*114514 % 100] = y;
dfs(rand()*rand() % 100,rand()*rand() % 100);
// cout<<1<<endl;
cout<<sum<<endl;
return 0;
}
全部评论 4
#include <iostream> using namespace std; int main() { int a,b; cin >> a >> b; cout << a+b; return 0; }2024-07-02 来自 浙江
0错误的，应该是
//前面一大堆头文件省略 #define int long long using namespace std; std::random_device rd; unsigned int seed = rd(); std::mt19937 engine(seed); char *p1, *p2, buf[100000]; #define nc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++) int read() { int x = 0, f = 1; char ch = nc(); while (ch < 48 || ch > 57) { if (ch == '-') f = -1; ch = nc(); } while (ch >= 48 && ch <= 57) x = x * 10 + ch - 48, ch = nc(); return x * f; } void write(int x) { if (x < 0) putchar('-'), x = -x; if (x > 9) write(x / 10); putchar(x % 10 + '0'); return; } int sum,nextt[4][2]={1,0,0,1,-1,0,0,-1}; int mp[100][100]; bool vis[100][100]; void dfs(int x, int y) { // cout<<x<<" "<<y<<endl; sum+=mp[x][y]; vis[x][y]=1; for(int i=0;i<4;i++){ int dx=x+nextt[i][0],dy=y+nextt[i][1]; if(dx>=0&&dx<=99&&dy>=0&&dy<=99&&vis[dx][dy]==false){ // vis[dx][dy]=1; dfs(dx,dy); // vis[dx][dy]=0; } } } signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int x,y; cin>>x>>y; mp[rand() % 100][rand() % 100] = x; mp[rand()*10086 % 100][rand()*114514 % 100] = y; dfs(rand() % 100,rand() % 100); // cout<<1<<endl; cout<<sum<<endl; return 0; }（不是）
2024-07-02 来自 广东
0
有帮助，赞一个