QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#449412#2868. Preparing a contestRedreamMer100 ✓0ms3872kbC++171.0kb2024-06-21 09:10:352024-06-21 09:10:35

Judging History

你现在查看的是最新测评结果

  • [2024-06-21 09:10:35]
  • 评测
  • 测评结果:100
  • 用时:0ms
  • 内存:3872kb
  • [2024-06-21 09:10:35]
  • 提交

answer

// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <iomanip>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }



signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cout << "huahua";
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3872kb

input:



output:

huahua

result:

ok