QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#31258 | #1212. Navigation | 275307894a | Compile Error | / | / | C++14 | 2.0kb | 2022-05-05 21:51:35 | 2023-01-16 13:46:04 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-01-16 13:46:04]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2022-05-05 21:51:35]
- 提交
Anna
#include "Spy.h"
#include <vector>
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define ll long long
#define db double
#define lb long db
#define N (250000+5)
#define M (220+5)
#define K (12+5)
#define mod 1000000007
#define Mod (mod-1)
#define eps (1e-9)
#define ull unsigned ll
#define it iterator
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) (n*(x-1)+(y))
#define R(n) (rand()*rand()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using namespace std;
namespace {
int variable = 0;
int function() {
return 42;
}
}
vector<int> Fl;vector<int> S[N];
I void dfs(int x,int La){La&&(Fl[x]=Fl[La]^(x>La));for(int i:S[x]) i^La&&(dfs(i,x),0);}
std::vector <int> Init(int n, int T, std::vector <int> A, std::vector <int> B) {int i;for(i=1;i<=n;i++) Fl.PB(0);for(i=0;i<A.size();i++) S[A[i]-1].PB(B[i]-1),S[B[i]-1].PB(A[i]-1);dfs(T-1,0);return Fl;}
Bruno
#include "Participant.h"
#include <vector>
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define ll long long
#define db double
#define lb long db
#define N (250000+5)
#define M (220+5)
#define K (12+5)
#define mod 1000000007
#define Mod (mod-1)
#define eps (1e-9)
#define ull unsigned ll
#define it iterator
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) (n*(x-1)+(y))
#define R(n) (rand()*rand()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
namespace {
int variable = 0;
int function() {
return 42;
}
}
using namespace std;
int Query(int S, int F, int L, std::vector <int> P, std::vector <int> Q) {
for(int i=0;i<L;i++) if(Q[i]^F^(P[i]>S)) return P[i];return S;
}
詳細信息
Anna.code:1:10: fatal error: Spy.h: No such file or directory 1 | #include "Spy.h" | ^~~~~~~ compilation terminated. Bruno.code:1:10: fatal error: Participant.h: No such file or directory 1 | #include "Participant.h" | ^~~~~~~~~~~~~~~ compilation terminated. grader.cpp: In function ‘int main(int, char**)’: grader.cpp:144:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 144 | scanf("%d%d%d%d", &K, &S, &F, &L); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ grader.cpp:146:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 146 | scanf("%d", &P_[i]); | ~~~~~^~~~~~~~~~~~~~ grader.cpp:150:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 150 | scanf("%d", &Q_[i]); | ~~~~~^~~~~~~~~~~~~~