QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #423609 | #2559. Endless Road | Farmer_D | Compile Error | / | / | C++14 | 5.3kb | 2024-05-28 12:22:22 | 2024-05-28 12:22:22 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
answer.code: In lambda function:
answer.code:105:55: error: missing template arguments before ‘{’ token
105 | sort(rnk+1,rnk+n+1,[&](int o1,int o2){ return pair{rng[o1].fi,-rng[o1].se}<pair{rng[o2].fi,-rng[o2].se};});
| ^
answer.code:105:55: error: expected ‘;’ before ‘{’ token
105 | sort(rnk+1,rnk+n+1,[&](int o1,int o2){ return pair{rng[o1].fi,-rng[o1].se}<pair{rng[o2].fi,-rng[o2].se};});
| ^
| ;
answer.code:105:78: error: expected ‘;’ before ‘}’ token
105 | sort(rnk+1,rnk+n+1,[&](int o1,int o2){ return pair{rng[o1].fi,-rng[o1].se}<pair{rng[o2].fi,-rng[o2].se};});
| ^
answer.code:105:79: error: expected primary-expression before ‘<’ token
105 | sort(rnk+1,rnk+n+1,[&](int o1,int o2){ return pair{rng[o1].fi,-rng[o1].se}<pair{rng[o2].fi,-rng[o2].se};});
| ^
answer.code:105:84: error: missing template arguments before ‘{’ token
105 | sort(rnk+1,rnk+n+1,[&](int o1,int o2){ return pair{rng[o1].fi,-rng[o1].se}<pair{rng[o2].fi,-rng[o2].se};});
| ^
answer.code: In lambda function:
answer.code:106:55: error: missing template arguments before ‘{’ token
106 | sort(rng+1,rng+n+1,[&](pii o1,pii o2){ return pair{o1.fi,-o1.se}<pair{o2.fi,-o2.se};});
| ^
answer.code:106:55: error: expected ‘;’ before ‘{’ token
106 | sort(rng+1,rng+n+1,[&](pii o1,pii o2){ return pair{o1.fi,-o1.se}<pair{o2.fi,-o2.se};});
| ^
| ;
answer.code:106:68: error: expected ‘;’ before ‘}’ token
106 | sort(rng+1,rng+n+1,[&](pii o1,pii o2){ return pair{o1.fi,-o1.se}<pair{o2.fi,-o2.se};});
| ^
answer.code:106:69: error: expected primary-expression before ‘<’ token
106 | sort(rng+1,rng+n+1,[&](pii o1,pii o2){ return pair{o1.fi,-o1.se}<pair{o2.fi,-o2.se};});
| ^
answer.code:106:74: error: missing template arguments before ‘{’ token
106 | sort(rng+1,rng+n+1,[&](pii o1,pii o2){ return pair{o1.fi,-o1.se}<pair{o2.fi,-o2.se};});
| ^
answer.code: In function ‘int main()’:
answer.code:137:18: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
137 | auto [mxr,ID]=sgt1.qry(1,cnt,1,lp,rp);
| ^