QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#451884 | #2810. Speedrun | egypt_ioi2024_12# | Compile Error | / | / | C++20 | 4.7kb | 2024-06-23 17:42:09 | 2024-06-23 17:42:10 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
speedrun.code:124:10: error: redefinition of ‘const ll mod’ 124 | const ll mod=1e9+7; | ^~~ speedrun.code:26:10: note: ‘const ll mod’ previously defined here 26 | const ll mod=1e9+7; | ^~~ speedrun.code:125:5: error: redefinition of ‘int dx [8]’ 125 | int dx[8]={0,1,0,-1,1,1,-1,-1}; | ^~ speedrun.code:27:5: note: ‘int dx [8]’ previously defined here 27 | int dx[8]={0,1,0,-1,1,1,-1,-1}; | ^~ speedrun.code:126:5: error: redefinition of ‘int dy [8]’ 126 | int dy[8]={1,0,-1,0,1,-1,-1,1}; | ^~ speedrun.code:28:5: note: ‘int dy [8]’ previously defined here 28 | int dy[8]={1,0,-1,0,1,-1,-1,1}; | ^~ speedrun.code:128:4: error: redefinition of ‘ll lcm(ll, ll)’ 128 | ll lcm(ll a,ll b) | ^~~ speedrun.code:30:4: note: ‘ll lcm(ll, ll)’ previously defined here 30 | ll lcm(ll a,ll b) | ^~~ speedrun.code:132:6: error: redefinition of ‘void person_bool(bool)’ 132 | void person_bool(bool x) | ^~~~~~~~~~~ speedrun.code:34:6: note: ‘void person_bool(bool)’ previously defined here 34 | void person_bool(bool x) | ^~~~~~~~~~~ speedrun.code:141:11: error: redefinition of ‘const int N’ 141 | const int N=1005; | ^ speedrun.code:43:11: note: ‘const int N’ previously defined here 43 | const int N=1005; | ^ speedrun.code:142:12: error: redefinition of ‘std::vector<int> adj [1005]’ 142 | vector<int>adj[N]; | ^~~ speedrun.code:44:12: note: ‘std::vector<int> adj [1005]’ previously declared here 44 | vector<int>adj[N]; | ^~~ speedrun.code:143:12: error: redefinition of ‘std::vector<int> ord’ 143 | vector<int>ord; | ^~~ speedrun.code:45:12: note: ‘std::vector<int> ord’ previously declared here 45 | vector<int>ord; | ^~~ speedrun.code:144:5: error: redefinition of ‘int node_ord [1005]’ 144 | int node_ord[N],p[N]; | ^~~~~~~~ speedrun.code:46:5: note: ‘int node_ord [1005]’ previously declared here 46 | int node_ord[N],p[N]; | ^~~~~~~~ speedrun.code:144:17: error: redefinition of ‘int p [1005]’ 144 | int node_ord[N],p[N]; | ^ speedrun.code:46:17: note: ‘int p [1005]’ previously declared here 46 | int node_ord[N],p[N]; | ^ speedrun.code:145:6: error: redefinition of ‘void dfs(int, int)’ 145 | void dfs(int node,int par){ | ^~~ speedrun.code:47:6: note: ‘void dfs(int, int)’ previously defined here 47 | void dfs(int node,int par){ | ^~~ speedrun.code:153:6: error: redefinition of ‘void assignHints(int, int, int*, int*)’ 153 | void assignHints(int subtask , int n, int a[], int b[]){ | ^~~~~~~~~~~ speedrun.code:55:6: note: ‘void assignHints(int, int, int*, int*)’ previously defined here 55 | void assignHints(int subtask , int n, int a[], int b[]){ | ^~~~~~~~~~~ speedrun.code:170:5: error: redefinition of ‘int getParent()’ 170 | int getParent(){ | ^~~~~~~~~ speedrun.code:72:5: note: ‘int getParent()’ previously defined here 72 | int getParent(){ | ^~~~~~~~~ speedrun.code:177:5: error: redefinition of ‘int getNext()’ 177 | int getNext(){ | ^~~~~~~ speedrun.code:79:5: note: ‘int getNext()’ previously defined here 79 | int getNext(){ | ^~~~~~~ speedrun.code:184:6: error: redefinition of ‘void speedrun(int, int, int)’ 184 | void speedrun(int subtask , int n, int start){ | ^~~~~~~~ speedrun.code:86:6: note: ‘void speedrun(int, int, int)’ previously defined here 86 | void speedrun(int subtask , int n, int start){ | ^~~~~~~~ speedrun.code: In function ‘void speedrun(int, int, int)’: speedrun.code:186:41: error: too many arguments to function ‘int getParent()’ 186 | while(start!=1)start=getParent(start),goTo(start); | ^ speedrun.code:72:5: note: declared here 72 | int getParent(){ | ^~~~~~~~~ grader_speedrun.cpp: In function ‘int readvalue()’: grader_speedrun.cpp:9:9: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 9 | fscanf(input, "%d", &val); | ~~~~~~^~~~~~~~~~~~~~~~~~~