影石Insta360杯-2025牛客暑期多校训练营10——I.Matrix (matrix) · znzryb
## 思路讲解
+,-,+,-的走就可以了。
## AC代码
[https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78859553](https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78859553)
::: 源代码
```cpp
// by Gospel_rock
#include <bits/stdc++.h>
#include <vector>
#define all(vec) vec.begin(),vec.end()
#define PB push_back
#define EB emplace_back
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define SZ(a) ((long long) a.size())
#define FOR(i, a, b) for (long long i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (long long i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define lson(var) (var<<1)
#define rson(var) (var<<1|1)
#define fsp(x) fixed<<setprecision(x)
#define minn(vec) *min_element(vec.begin(),vec.end())
#define maxx(vec) *max_element(vec.begin(),vec.end())
using namespace std;
#ifdef LOCAL
template<typename T> void _print(T x) { cerr << x; }
template<typename T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) _print(i), cerr << " "; cerr << "]"; }
template<typename T> void _print(set<T> s) { cerr << "{ "; for (T i : s) _print(i), cerr << " "; cerr << "}"; }
template<typename T, typename U> void _print(pair<T, U> p) { cerr << "{"; _print(p.first); cerr << ", "; _print(p.second); cerr << "}"; }
template<typename T, typename U> void _print(map<T, U> m) { cerr << "{ "; for (auto &p : m) _print(p), cerr << " "; cerr << "}"; }
#endif
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using i128 = __int128;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;using vii=vector<int>;
using vpll = vector<pll>;using vtll = vector<tll>;
using vdb = vector<DB>;using vc=vector<char>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
using CD=complex<double>;
static constexpr ll MAXN=(ll)1e6+10,INF=(ll)1e17+3; // 1e17+3是素数 1e18+9是素数
static constexpr ll mod=(ll)1e9+7; // 998244353;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,T,lT;
inline void __();
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// cin>>lT;
// while(lT--)
__();
return 0;
}
/*
*/
inline ll MOD(const ll &a,const ll &b){
ll res=a%b;
if(res<0) res+=b;
return res;
}
inline void __(){
cin>>N>>M;
if(__gcd(N,M)!=1){
cout<<"NO\n";
return;
}
// (2+12)%6=2
// ll x=0,y=0;
vector<vll> Ans(N+5,vll(M+5));
Ans[0][0]=1;
ll x=0,y=0,fx=1,fy=1;
FOR(i,2,N*M){
ll tx,ty;
tx=MOD(x+fx*(i-1),N),ty=y;
if(Ans[tx][ty]==0){
tie(x,y)={tx,ty};
fx=-fx;
Ans[tx][ty]=i;
continue;
}
tx=x,ty=MOD(y+fy*(i-1),M);
if(Ans[tx][ty]==0){
tie(x,y)={tx,ty};
fy=-fy;
Ans[tx][ty]=i;
continue;
}
}
cout<<"YES\n";
FOR(i,0,N-1){
FOR(j,0,M-1){
cout<<Ans[i][j]<<" ";
}
cout<<"\n";
}
}
/*
AC
https://ac.nowcoder.com/acm/contest/view-submission?submissionId=78859553
*/
```
:::
## 心路历程（WA，TLE，MLE……）