Submitted 3 years 6 months 1 day ago
Sun Apr 25 11:35:18 CST 2021
Judger: judger1
Dataset Version: v1
955 ms /
261636 KB
Final
749
Problem: fun21.density
Language: GNU C++ 11
8
1
100 Rank: BULLSEYE, Score 100. Density=9.00. Delta=1.00
16
1
100 Rank: BULLSEYE, Score 100. Density=15.00. Delta=1.00
32
1
100 Rank: BULLSEYE, Score 100. Density=32.00. Delta=0.00
128
1
100 Rank: BULLSEYE, Score 100. Density=127.00. Delta=1.00
233
1
100 Rank: BULLSEYE, Score 100. Density=233.00. Delta=0.00
262
1
100 Rank: BULLSEYE, Score 100. Density=262.00. Delta=0.00
262.144
1
100 Rank: BULLSEYE, Score 100. Density=262.00. Delta=0.14
666.66
1
20 Rank: SS, Score 20. Density=655.00. Delta=11.66
1024.996
1
10 Rank: S, Score 10. Density=998.00. Delta=27.00
1888.88
1
6 Rank: B, Score 6. Density=1390.00. Delta=498.88
2048
1
4 Rank: C, Score 4. Density=1327.00. Delta=721.00
4096
1
1 Rank: D, Score 1. Density=1178.00. Delta=2918.00
10000
1
1 Rank: D, Score 1. Density=1167.00. Delta=8833.00
12345
1
1 Rank: D, Score 1. Density=1327.00. Delta=11018.00
20000
1
1 Rank: D, Score 1. Density=1333.00. Delta=18667.00
100000
1
1 Rank: D, Score 1. Density=1194.00. Delta=98806.00
114514
1
1 Rank: D, Score 1. Density=1320.00. Delta=113194.00
191981.0
1
1 Rank: D, Score 1. Density=1307.00. Delta=190674.00
200000
1
1 Rank: D, Score 1. Density=1275.00. Delta=198725.00
262000
1
1 Rank: D, Score 1. Density=1308.00. Delta=260692.00
//Original Code:
///*
//Code by Zzzyt
//
//Problem: [2021 Fun]Density o' bullseye (HHSOJ fun21.density)
//Algorithm:
//Status:
//Date: 20210424
//Version: 1
//*/
//
//#include <algorithm>
//#include <deque>
//#include <iostream>
//#include <map>
//#include <math.h>
//#include <queue>
//#include <set>
//#include <sstream>
//#include <stack>
//#include <stdio.h>
//#include <stdlib.h>
//#include <string.h>
//#include <string>
//#include <time.h>
//#include <utility>
//#include <vector>
//// #include <chrono>
//// #include <random>
//
//using namespace std;
//
//#define popc(x) __builtin_popcount(x)
//#define over(x) \
// { \
// printf(x); \
// putchar('\n'); \
// exit(0); \
// }
//#define all(x) x.begin(), x.end()
//#define ceil(a, b) ((a - 1) / b + 1)
//#define srand() srand(time(0))
//#define srandx() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
//#define randx(l, r) uniform_int_distribution<int>(l, r)(rng)
//#define pii pair<int, int>
//#define nosync ios::sync_with_stdio(0)
//#define pb push_back
//typedef long long ll;
//typedef unsigned long long ull;
//
//inline int fread() {
// char ch = getchar();
// int x = 0, f = 1;
// while (ch < '0' || ch > '9') {
// if (ch == '-')
// f = -1;
// ch = getchar();
// }
// while (ch >= '0' && ch <= '9') {
// x = x * 10 + ch - '0';
// ch = getchar();
// }
// return x * f;
//}
//
//template <typename T1, typename T2>
//ostream &operator<<(ostream &os, const pair<T1, T2> &ptt) {
// os << "(" << ptt.first << ", " << ptt.second << ")";
// return os;
//}
//
//template <typename T>
//ostream &operator<<(ostream &os, const vector<T> &vt) {
// os << "{";
// for (int i = 0; i < vt.size() - 1; i++) {
// os << vt[i] << ", ";
// }
// os << vt[vt.size() - 1] << "}";
// return os;
//}
//
///* -------- End of Template -------- */
//
//#define INF 1000000007
//
//#pragma GCC optimize("O0")
//
//void getmem(double KB) {
// int target = KB / 4 - 862;
// if (target < 0)
// return;
// while (--target) {
// malloc(4096);
// }
//}
//
//int main(int argc, char *argv[]) {
// cin.tie(0);
// //freopen(".in", "r", stdin);
//#ifndef ZZZYT
// //freopen(".out", "w", stdout);
//#endif
// double d;
// cin >> d;
// double t = 261550 / d;
// if (t > 950) {
// t = 950;
// double m = 950 * d;
// getmem(m);
// } else {
// getmem(261550);
// }
// int target = t - 1;
// if (d > 200 && d < 300) {
// target -= 9;
// }
// while (clock() / 1000 < target) {
// }
// return 0;
//}
//substituted with C++ Inliner
/*
Code by Zzzyt
Problem: [2021 Fun]Density o' bullseye (HHSOJ fun21.density)
Algorithm:
Status:
Date: 20210424
Version: 1
*/
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
// #include <chrono>
// #include <random>
using namespace std;
#define popc(x) __builtin_popcount(x)
#define over(x) \
{ \
printf(x); \
putchar('\n'); \
exit(0); \
}
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a - 1) / b + 1)
#define srand() srand(time(0))
#define srandx() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define randx(l, r) uniform_int_distribution<int>(l, r)(rng)
#define pii pair<int, int>
#define nosync ios::sync_with_stdio(0)
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
inline int fread() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &ptt) {
os << "(" << ptt.first << ", " << ptt.second << ")";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vt) {
os << "{";
for (int i = 0; i < vt.size() - 1; i++) {
os << vt[i] << ", ";
}
os << vt[vt.size() - 1] << "}";
return os;
}
/* -------- End of Template -------- */
#define INF 1000000007
#pragma GCC optimize("O0")
void getmem(double KB) {
int target = KB / 4 - 862;
if (target < 0)
return;
while (--target) {
malloc(4096);
}
}
int main(int argc, char *argv[]) {
cin.tie(0);
//freopen(".in", "r", stdin);
#ifndef ZZZYT
//freopen(".out", "w", stdout);
#endif
double d;
cin >> d;
double t = 261550 / d;
if (t > 950) {
t = 950;
double m = 950 * d;
getmem(m);
} else {
getmem(261550);
}
int target = t - 1;
if (d > 200 && d < 300) {
target -= 9;
}
while (clock() / 1000 < target) {
}
return 0;
}
Main.cpp: In function ‘void getmem(double)’: Main.cpp:214:15: warning: ignoring return value of ‘void* malloc(size_t)’, declared with attribute warn_unused_result [-Wunused-result] malloc(4096); ~~~~~~^~~~~~