QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#155165 | #7119. Longest Trip | yzy1 | 0 | 1ms | 4096kb | C++17 | 1.4kb | 2023-09-01 12:44:29 | 2023-09-01 12:44:30 |
Judging History
answer
#include <bits/stdc++.h>
#include "longesttrip.h"
#if defined(LOCAL)
#define DBG_MACRO_NO_WARNING
#include <dbg.hpp>
#include "grader.cpp"
#else
#define dbg(x...) (0)
#endif
using namespace std;
using ll = long long;
// #define int ll
#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)
#define re(i, t) rep (i, 1, t)
#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)
#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)
#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)
#define umod(x) ((x) >= mo && ((x) -= mo))
#define dmod(x) ((x) < 0 && ((x) += mo))
#define y1 y1__
#define fio(x) (freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout))
template <class T, class E>
__attribute__((always_inline)) inline void up(T &x, E &&y) {
if (x < y) x = y;
}
template <class T, class E>
__attribute__((always_inline)) inline void down(T &x, E &&y) {
if (y < x) x = y;
}
int n, m;
inline bool Ask(vector<int> x, vector<int> y) {
for (auto &v : x) ++v;
for (auto &v : y) ++v;
return are_connected(x, y);
}
inline vector<int> Work() {
if (m == 3) {
vector<int> vec;
re (i, n) vec.push_back(i);
return vec;
}
return {};
}
std::vector<int> longest_trip(int N, int D) {
::n = N, ::m = D;
auto vec = Work();
for (auto &x : vec) ++x;
return vec;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 4096kb
input:
341 3 3
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 3 2 3 4
result:
wrong answer
Subtask #2:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 1ms
memory: 3804kb
input:
341 3 2
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 0
result:
wrong answer
Subtask #3:
score: 0
Wrong Answer
Test #19:
score: 0
Wrong Answer
time: 1ms
memory: 3800kb
input:
341 3 1
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 0
result:
wrong answer
Subtask #4:
score: 0
Wrong Answer
Test #83:
score: 0
Wrong Answer
time: 1ms
memory: 3804kb
input:
341 3 1
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 0
result:
wrong answer