提交记录 19124
提交时间 |
评测时间 |
2023-02-07 20:51:29 |
2023-02-07 20:51:33 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,popcnt,bmi,bmi2")
void count_5d(int n, const int **x, unsigned *out) {
#define n 100000
for (int i=0; i<n; i+=2) { int r[2][5] = {{x[0][i], x[1][i], x[2][i], x[3][i], x[4][i]},{x[0][i+1], x[1][i+1], x[2][i+1], x[3][i+1], x[4][i+1]},}; for (int j=0; j<n; ++j) {
out[j] += (r[0][0]<x[0][j] & r[1][0]<x[1][j] & r[2][0]<x[2][j] & r[3][0]<x[3][j] & r[4][0]<x[4][j]) + (r[0][1]<x[0][j] & r[1][1]<x[1][j] & r[2][1]<x[2][j] & r[3][1]<x[3][j] & r[4][1]<x[4][j]) ;
}}
}
Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
Testcase #1 | 2.41 s | 400 KB | Wrong Answer | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2025-09-16 01:00:33 | Loaded in 0 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠