QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #19588 | #2426. The Xana coup | hualian | Compile Error | / | / | C++14 | 570b | 2022-02-06 11:39:56 | 2022-05-18 04:06:52 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2022-05-18 04:06:52]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2022-02-06 11:39:56]
- 提交
answer
#include "swaps.h"
#include <bits/stdc++.h>
#define pi pair<int,int>
#define mk make_pair
#define rep(i, a) for(register int i=1,i##end=a;i<=i##end;i++)
using namespace std;
void solve(int n, int D) {
vector<int>ans;ans.resize(n);
rep(i,n)ans[i-1]=i;
for (int i=0;i<D;i++) {
vector<pi>A;
for(int j=i%2;j+1<ans.size();j+=2) {
schedule(ans[j],ans[j+1]);
A.push_back(mk(j,j+1));
}
if(!A.empty()){
auto res=visit();
for(int j=0;j<A.size();j++)
if(!res[j])swap(ans[A[j].first],ans[A[j].second]);
}
}
answer(ans);return;
}
Details
answer.code:1:10: fatal error: swaps.h: No such file or directory
1 | #include "swaps.h"
| ^~~~~~~~~
compilation terminated.