Submission #7053500


Source Code Expand

#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
const int INF32       = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7        = 1'000'000'007;
const int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    int x      = N / 25 + N % 25;
    string ans = "123456";
    REP(i, x) {
        int a = i % 5;
        int b = i % 5 + 1;
        swap(ans[a], ans[b]);
    }
    print(ans);

    return 0;
}

Submission Info

Submission Time
Task C - 入れ替え
User kobyn
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1886 Byte
Status WA
Exec Time 97 ms
Memory 256 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 30 0 / 70
Status
AC × 7
WA × 6
AC × 7
WA × 20
Set Name Test Cases
Subtask1 SubTask1/00_sample_00.txt, SubTask1/00_sample_01.txt, SubTask1/00_sample_02.txt, SubTask1/rand_19.txt, SubTask1/rand_2.txt, SubTask1/rand_25.txt, SubTask1/rand_27.txt, SubTask1/rand_33.txt, SubTask1/rand_35.txt, SubTask1/rand_4.txt, SubTask1/rand_44.txt, SubTask1/rand_48.txt, SubTask1/rand_8.txt
Subtask2 SubTask2/00_sample_03.txt, SubTask2/max_case.txt, SubTask2/rand_120009641.txt, SubTask2/rand_134230520.txt, SubTask2/rand_136939465.txt, SubTask2/rand_200732473.txt, SubTask2/rand_211796835.txt, SubTask2/rand_312330341.txt, SubTask2/rand_377341731.txt, SubTask2/rand_384611280.txt, SubTask2/rand_386098102.txt, SubTask2/rand_399010727.txt, SubTask2/rand_409627453.txt, SubTask2/rand_416537730.txt, SubTask2/rand_425486442.txt, SubTask2/rand_493135174.txt, SubTask2/rand_573105326.txt, SubTask2/rand_62794810.txt, SubTask2/rand_649471654.txt, SubTask2/rand_693017484.txt, SubTask2/rand_729197057.txt, SubTask2/rand_759630883.txt, SubTask2/rand_823752210.txt, SubTask2/rand_830399384.txt, SubTask2/rand_893242387.txt, SubTask2/rand_935005824.txt, SubTask2/rand_989703310.txt
Case Name Status Exec Time Memory
SubTask1/00_sample_00.txt AC 1 ms 256 KB
SubTask1/00_sample_01.txt AC 1 ms 256 KB
SubTask1/00_sample_02.txt AC 1 ms 256 KB
SubTask1/rand_19.txt AC 1 ms 256 KB
SubTask1/rand_2.txt AC 1 ms 256 KB
SubTask1/rand_25.txt WA 1 ms 256 KB
SubTask1/rand_27.txt WA 1 ms 256 KB
SubTask1/rand_33.txt WA 1 ms 256 KB
SubTask1/rand_35.txt WA 1 ms 256 KB
SubTask1/rand_4.txt AC 1 ms 256 KB
SubTask1/rand_44.txt WA 1 ms 256 KB
SubTask1/rand_48.txt WA 1 ms 256 KB
SubTask1/rand_8.txt AC 1 ms 256 KB
SubTask2/00_sample_03.txt AC 11 ms 256 KB
SubTask2/max_case.txt AC 97 ms 256 KB
SubTask2/rand_120009641.txt AC 13 ms 256 KB
SubTask2/rand_134230520.txt AC 14 ms 256 KB
SubTask2/rand_136939465.txt WA 15 ms 256 KB
SubTask2/rand_200732473.txt WA 21 ms 256 KB
SubTask2/rand_211796835.txt WA 21 ms 256 KB
SubTask2/rand_312330341.txt WA 31 ms 256 KB
SubTask2/rand_377341731.txt WA 37 ms 256 KB
SubTask2/rand_384611280.txt WA 38 ms 256 KB
SubTask2/rand_386098102.txt WA 38 ms 256 KB
SubTask2/rand_399010727.txt WA 38 ms 256 KB
SubTask2/rand_409627453.txt WA 42 ms 256 KB
SubTask2/rand_416537730.txt WA 42 ms 256 KB
SubTask2/rand_425486442.txt WA 43 ms 256 KB
SubTask2/rand_493135174.txt WA 47 ms 256 KB
SubTask2/rand_573105326.txt WA 55 ms 256 KB
SubTask2/rand_62794810.txt WA 7 ms 256 KB
SubTask2/rand_649471654.txt WA 65 ms 256 KB
SubTask2/rand_693017484.txt WA 66 ms 256 KB
SubTask2/rand_729197057.txt WA 72 ms 256 KB
SubTask2/rand_759630883.txt AC 72 ms 256 KB
SubTask2/rand_823752210.txt WA 82 ms 256 KB
SubTask2/rand_830399384.txt AC 79 ms 256 KB
SubTask2/rand_893242387.txt AC 87 ms 256 KB
SubTask2/rand_935005824.txt WA 92 ms 256 KB
SubTask2/rand_989703310.txt WA 97 ms 256 KB