#278

by ‮yeknom

Submitted 1 year 3 months ago
Sun Apr 25 11:33:12 CST 2021
Judger: judger1
Dataset Version: v1

994 ms / 208348 KB
Final 435
Problem: fun21.density
Language: GNU C++ 11


#1

994ms / 8820KB / Point
Input
8
Output
2
Answer
1
Checker Information
100 Rank: BULLSEYE, Score 100. Density=8.00. Delta=0.00

#2

549ms / 8780KB / Point
Input
16
Output
3
Answer
1
Checker Information
100 Rank: BULLSEYE, Score 100. Density=15.00. Delta=1.00

#3

274ms / 8800KB / Point
Input
32
Output
2
Answer
1
Checker Information
100 Rank: BULLSEYE, Score 100. Density=32.00. Delta=0.00

#4

68ms / 8760KB / Point
Input
128
Output
2
Answer
1
Checker Information
25 Rank: SSS, Score 25. Density=126.00. Delta=2.00

#5

38ms / 8832KB / Point
Input
233
Output
2
Answer
1
Checker Information
25 Rank: SSS, Score 25. Density=226.00. Delta=7.00

#6

34ms / 8800KB / Point
Input
262
Output
3
Answer
1
Checker Information
20 Rank: SS, Score 20. Density=251.00. Delta=11.00

#7

32ms / 8804KB / Point
Input
262.144
Output
3
Answer
1
Checker Information
25 Rank: SSS, Score 25. Density=266.00. Delta=3.86

#8

328ms / 208348KB / Point
Input
666.66
Output
2
Answer
1
Checker Information
8 Rank: A, Score 8. Density=633.00. Delta=33.66

#9

213ms / 208312KB / Point
Input
1024.996
Output
3
Answer
1
Checker Information
8 Rank: A, Score 8. Density=973.00. Delta=52.00

#10

3ms / 8812KB / Point
Input
1888.88
Output
1
Answer
1
Checker Information
6 Rank: B, Score 6. Density=2203.00. Delta=314.12

#11

2ms / 8832KB / Point
Input
2048
Output
1
Answer
1
Checker Information
4 Rank: C, Score 4. Density=2944.00. Delta=896.00

#12

1ms / 8808KB / Point
Input
4096
Output
1
Answer
1
Checker Information
6 Rank: B, Score 6. Density=4404.00. Delta=308.00

#13

2ms / 8836KB / Point
Input
10000
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2945.00. Delta=7055.00

#14

2ms / 8832KB / Point
Input
12345
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2944.00. Delta=9401.00

#15

2ms / 8904KB / Point
Input
20000
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2968.00. Delta=17032.00

#16

3ms / 8836KB / Point
Input
100000
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2209.00. Delta=97791.00

#17

2ms / 8724KB / Point
Input
114514
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2908.00. Delta=111606.00

#18

3ms / 8800KB / Point
Input
191981.0
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2200.00. Delta=189781.00

#19

3ms / 8832KB / Point
Input
200000
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2208.00. Delta=197792.00

#20

3ms / 8820KB / Point
Input
262000
Output
1
Answer
1
Checker Information
1 Rank: D, Score 1. Density=2205.00. Delta=259795.00
//Original Code:
//#pragma GCC optimize("O0")
//#include <self/utility>
//#include <self/debug>
//#include <self/rand>
//using namespace std;
//double st=clock();
//
//void getmem(double KB) {
//    int target = KB / 4/* - 862*/;
//    if (target < 0)
//        return;
//    while (--target) {
//        malloc(4096);
//    }	
//}
//
//int main()
//{
//	freopen("input.txt","r",stdin);
//	double d;
//	cin>>d;
//	if(d>=1500) over("1");
//	double nt;
//	if(d<=500)
//	{
//		nt=8800.0/d-3;
//	}
//	else
//	{
//		getmem(200*1024);
//		nt=(8800+200*1024)/d-4;
//	}
//	// debug(nt);
//	chmin(nt,990);
//	if(nt<0) return 0;
//	int a=2,b=3;
//	while(clock()-st<nt/1000*CLOCKS_PER_SEC)
//	{
//		a^=b^=a^=b;
//	}
//	cout<<a<<endl;
//	return 0;
//}

//substituted with C++ Inliner
#pragma GCC optimize("O0")
#ifndef _SELF_UTILITY
#define _SELF_UTILITY 1
#include <numeric>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#include <time.h>
#define Endl endl
#define mp make_pair
#define mt make_tuple
#define ll long long 
#define ull unsigned long long
#define pii pair<int,int>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define quickcin ios_base::sync_with_stdio(false);
#ifdef __TAKE_MOD
int mod;
#else
#ifdef __TAKE_CONST_MOD
const int mod=__TAKE_CONST_MOD;
#else
const int mod=1000000007;
#endif
#endif
const int gmod=3;
const int inf=1039074182;
#ifdef __TAKE_CONST_EPS
const double eps=__TAKE_CONST_EPS;
#else
const double eps=1e-9;
#endif
const double pi=3.141592653589793238462643383279;
const ll llinf=2LL*inf*inf;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
inline void chadd(int &x,int b) {x+=b-mod;x+=(x>>31 & mod);}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
template <typename T> inline T mabs(T x) {return (x<0?-x:x);}
using namespace std;
#endif
#ifndef _SELF_DEBUG
#define _SELF_DEBUG 1
#ifndef _SELF_OPERATOR
#define _SELF_OPERATOR 1
using namespace std;
template <typename T>
ostream & operator<<(ostream &cout, const vector<T> &vec)
{
	cout << "{";
	for (int i = 0; i < (int)vec.size(); i++)
	{
		cout << vec[i];
		if (i != (int)vec.size() - 1)
			cout << ',';
	}
	cout << "}";
	return cout;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &cout, pair<T1, T2> p)
{
	cout << "(" << p.first << ',' << p.second << ")";
	return cout;
}

template <typename T, typename T2>
ostream &operator<<(ostream &cout, set<T, T2> s)
{
	vector<T> t;
	for (auto x : s)
		t.push_back(x);
	cout << t;
	return cout;
}

template <typename T, typename T2>
ostream &operator<<(ostream &cout, multiset<T, T2> s)
{
	vector<T> t;
	for (auto x : s)
		t.push_back(x);
	cout << t;
	return cout;
}

template <typename T>
ostream &operator<<(ostream &cout, queue<T> q)
{
	vector<T> t;
	while (q.size())
	{
		t.push_back(q.front());
		q.pop();
	}
	cout << t;
	return cout;
}

template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &cout, map<T1, T2, T3> m)
{
	for (auto &x : m)
	{
		cout << "Key: " << x.first << ' ' << "Value: " << x.second << endl;
	}
	return cout;
}

template <typename T1, typename T2>
void operator+=(pair<T1, T2> &x,const pair<T1, T2> y)
{
	x.first += y.first;
	x.second += y.second;
}
template <typename T1,typename T2>
pair<T1,T2> operator + (const pair<T1,T2> &x,const pair<T1,T2> &y)
{
	return make_pair(x.first+y.first,x.second+y.second);
}

template <typename T1,typename T2>
pair<T1,T2> operator - (const pair<T1,T2> &x,const pair<T1,T2> &y)
{
	return mp(x.first-y.first,x.second-y.second);
}

template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> x)
{
	return make_pair(-x.first, -x.second);
}

template <typename T>
vector<vector<T>> operator~(vector<vector<T>> vec)
{
	vector<vector<T>> v;
	int n = vec.size(), m = vec[0].size();
	v.resize(m);
	for (int i = 0; i < m; i++)
	{
		v[i].resize(n);
	}
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			v[i][j] = vec[j][i];
		}
	}
	return v;
}
#endif
#include <sstream>
void print0x(int x)
{
	std::vector <int> vec;
	while(x)
	{
		vec.push_back(x&1);
		x>>=1;
	}
	std::reverse(vec.begin(),vec.end());
	for(int i=0;i<(int)vec.size();i++)
	{
		std::cout<<vec[i];
	}
	std::cout<<' ';
}

template <typename T>
void print0x(T x,int len)
{
	std::vector <int> vec;
	while(x)
	{
		vec.push_back(x&1);
		x>>=1;
	}
	reverse(vec.begin(),vec.end());
	for(int i=(int)vec.size();i<len;i++)
	{
		putchar('0');
	}
	for(size_t i=0;i<vec.size();i++)
	{
		std::cout<<vec[i];
	}
	std::cout<<' ';
}
vector<string> vec_splitter(string s) {
	s += ',';
	vector<string> res;
	while(!s.empty()) {
		res.push_back(s.substr(0, s.find(',')));
		s = s.substr(s.find(',') + 1);
	}
	return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx, 
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; } 
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
	if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
	stringstream ss; ss << H;
	cerr << args[idx] << " = " << ss.str();
	debug_out(args, idx + 1, LINE_NUM, T...);
}
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#endif
#ifndef _SELF_RAND
#define _SELF_RAND 1
#if __cplusplus < 201103L
long long _Rand_Gen_Num() {return 1LL*rand()*RAND_MAX+rand();}
int rand(int l,int r) {long long x=_Rand_Gen_Num();return x%(r-l+1)+l;}
#else
#include <time.h>
#include <chrono>
#include <random>
using namespace std; 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rand(l,r) uniform_int_distribution<long long>(l,r)(rng)
#endif
template <typename Iterator>
void _m_random_shuffle(Iterator begin,Iterator end)
{
    for(Iterator it=begin+1;it!=end;it++)
    {
        iter_swap(begin+rand(0,it-begin),it);
    }
}
#define random_shuffle(a,b) _m_random_shuffle(a,b)
#endif
using namespace std;
double st=clock();

void getmem(double KB) {
    int target = KB / 4/* - 862*/;
    if (target < 0)
        return;
    while (--target) {
        malloc(4096);
    }	
}

int main()
{
//	freopen("input.txt","r",stdin);
	double d;
	cin>>d;
	if(d>=1500) over("1");
	double nt;
	if(d<=500)
	{
		nt=8800.0/d-3;
	}
	else
	{
		getmem(200*1024);
		nt=(8800+200*1024)/d-4;
	}
	// debug(nt);
	chmin(nt,990);
	if(nt<0) return 0;
	int a=2,b=3;
	while(clock()-st<nt/1000*CLOCKS_PER_SEC)
	{
		a^=b^=a^=b;
	}
	cout<<a<<endl;
	return 0;
}
Main.cpp: In function ‘void getmem(double)’:
Main.cpp:305:15: warning: ignoring return value of ‘void* malloc(size_t)’, declared with attribute warn_unused_result [-Wunused-result]
         malloc(4096);
         ~~~~~~^~~~~~