提交记录 28963
| 用户 |
题目 |
状态 |
得分 |
用时 |
内存 |
语言 |
代码长度 |
| wxqwq |
test. 自定义测试 |
Memory Limit Exceeded |
0 |
0 ns |
0 KB |
C++14 |
936 B |
| 提交时间 |
评测时间 |
| 2026-05-05 21:46:43 |
2026-05-05 21:46:45 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb emplace_back
#define upb upper_bound
#define lowb lower_bound
#define gmx(a,b) (a=max(a,b))
#define gmn(a,b) (a=min(a,b))
#define siz(x) ((int)x.size())
#define all(x) begin(x),end(x)
#define fil(a,x) memset(a,x,sizeof(a))
#define ppcnt(x) __builtin_popcount(x)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
/*
*/
typedef long long LL;
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef unsigned long long ull;
typedef set<int>::iterator iter;
const int N=3e8+10;
int n=3e8;
unsigned a[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0);
#ifdef WXQWQ
freopen("biao.out","w",stdout);
#endif
mt19937 rnd(20080819);
rep(i,1,n) a[i]=rnd();
double st=clock();
rep(i,1,n) a[i+1]+=a[i];
cout<<a[n]<<"\n";
cerr<<(clock()-st)*1.0/CLOCKS_PER_SEC<<"\n";
return 0;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 0 ns | 0 KB | Memory Limit Exceeded | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-05-19 17:29:44 | Loaded in 0 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠