提出 #75083398

---

ソースコード 拡げる

#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <unordered_map>
#include <map>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <list>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numbers>
#include <iostream>
#include <string>
#include <random>

using namespace std;

#define fori(n)for (int i = 0; i < n; i++)
#define fo(n)for (int i = 0; i < n; i++)
#define fori1(n)for (ll i = 1; i < n + 1; i++)
#define revi1(n)for (int i = n; i >=0; i--)
#define forj(n)for (ll j = 0; j < (n); j++)
#define rep(i, n)for (ll i = 0; i < (n); i++)
#define repj(i, j, n)for (ll i = j; i < (n); i++)
#define forj1(n)for (ll j = 1; j < n+1; j++)
#define revj1(n)for (ll j = n; j >=0; j--)
#define revi(n)for (int i = n-1; i >= 0; i--)
#define ll long long
#define ull unsigned ll
#define MAXN (2147483647)
#define MINN (-2147483648)
#define ffast_io ios::sync_with_stdio(false);\
                 cout.tie(nullptr); cin.tie(nullptr)

string svo(bool fl) {
    if (fl)
        return "YES";
    return "NO";
}

vector<vector<ll>> multi(vector<vector<ll>> a, vector<vector<ll>> b) {
    vector<vector<ll>> res(a.size(), vector<ll>(b[0].size(), 0));
    fori(a.size()) {
        forj(b[0].size()) {
            ll temp = 0;
            rep(k, b.size())temp = (temp + (a[i][k] * b[k][j]) % 1000000007l) % 1000000007;
            res[i][j] = temp;
        }
    }
    return res;
}

vector<vector<ll>> pow(const vector<vector<ll>> &mat, int powred) {
    if (powred == 1) return mat;
    if (powred % 2 == 1) return multi(pow(mat, powred - 1), mat);
    vector<vector<ll>> temp = pow(multi(mat, mat), powred / 2);
    return temp;
}

ll pow1(ll mat, ll powred) {
    if (powred == 1L) return mat;
    if ((powred % 2LL) == 1LL) return (pow1(mat, powred - 1LL) * mat) % 10LL;
    auto temp = pow1((mat * mat) % 10LL, powred / 2LL);
    return temp;
}

template<typename T>
void debug(const std::vector<T> &ttt, std::ostream &out = std::cout) {
    int temp = 1;
    for (auto it = ttt.begin(); it != ttt.end(); ++it, temp++) out << *it << ' ';
    out << std::endl;
}

template<typename T>
void debug(const std::vector<vector<T>> &ttt, std::ostream &out = std::cout) {
    for (int it = 0; it != ttt.size(); ++it) debug(ttt[it]);
}

template<typename T>
void debug(set<T> ttt, std::ostream &out = std::cout) {
    for (auto t: ttt) out << t << " ";
    out << endl;
}

void debug(bool k, std::ostream &out = std::cout) { if (k) out << "yes"; else out << "no"; }

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,tune=native")


std::vector<int> prefix_function(const std::string &s) {
    int n = s.size();
    std::vector<int> pi(n);
    for (int i = 1; i < n; ++i) {
        int j = pi[i - 1];
        while (j > 0 && s[i] != s[j])
            j = pi[j - 1];
        if (s[i] == s[j]) ++j;
        pi[i] = j;
    }
    return pi;
}

void cout_path(int n, int a, int b) {
    string res;
    int row = 0, col = 0;

    fori(n - 1) {
        if (i % 2 == 0) {
            forj(n - 1) {
                if (!(row == a && col + 1 == b)) {
                    res += 'R';
                }
                col++;
            }
        } else {
            for (int j = 0; j < n - 1; j++) {
                if (!(row == a && col - 1 == b)) {
                    res += 'L';
                }
                col--;
            }
        }

        if (!(row + 1 == a && col == b)) {
            res += 'D';
        }
        row++;
    }

    fori(n - 1) {
        if (!(row == a && col + 1 == b)) {
            res += 'R';
        }
        col++;
    }

    cout << res << "\n";
}

void solve() {
    int q;
    cin >> q;
    while (q--) {
        int n, a, b;
        cin >> n >> a >> b;
        a--;
        b--;
        if ((n & 1) == 1) {
            cout << "No" << "\n";
            continue;
        }
        cout << "Yes" << "\n";
        cout_path(n, a, b);
    }
}

int main() {
    ffast_io;

    solve();


    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'std::vector<std::vector<long long int> > multi(std::vector<std::vector<long long int> >, std::vector<std::vector<long long int> >)':
./Main.cpp:26:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define fori(n)for (int i = 0; i < n; i++)
      |                                  ^
./Main.cpp:51:5: note: in expansion of macro 'fori'
   51 |     fori(a.size()) {
      |     ^~~~
./Main.cpp:30:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define forj(n)for (ll j = 0; j < (n); j++)
      |                               ~~^~~~~
./Main.cpp:52:9: note: in expansion of macro 'forj'
   52 |         forj(b[0].size()) {
      |         ^~~~
./Main.cpp:31:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 | #define rep(i, n)for (ll i = 0; i < (n); i++)
      |                                   ^
./Main.cpp:54:13: note: in expansion of macro 'rep'
   54 |             rep(k, b.size())temp = (temp + (a[i][k] * b[k][j]) % 1000000007l) % 1000000007;
      |             ^~~

ジャッジ結果