Submission #627257


Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>	
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define IFOR(i,a,b) for(int i=(a);i>(b);--i)
#define IREP(i,n)  IFOR(i,n,0)
#define GEFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define GEREP(i,n)  GEFOR(i,0,n)
#define ILEFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define ILEREP(i,n)  IGEFOR(i,n,0)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

// templete
template <typename T>
T clamp(const T& value, const T& low, const T& high)
{
	if (low >= high) return value;
	return min(max(value,low), high);
}

template <typename T>
void swap(T& x, T& y)
{
	T z;
	z = x; x = y; y = z;
}

// problem constant

// input value
int m;

// problem value

void init() {
	cin >> m;
}

void solve(){
	if(m < 100) cout << "00" <<endl;
	else if(m <= 5000) printf("%02.0f\n", m / 1000.0f * 10.0f);
	else if(m <= 30000) cout << m / 1000 + 50 << endl;
	else if(m <= 70000) cout << (m / 1000 - 30) / 5 + 80 << endl;
	else cout << "89" << endl;
}

int main(int argc, const char * argv[]) {
	init();
	solve();
	// cout << "answer" << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 視程の通報
User nagare7gawa
Language C++ (G++ 4.6.4)
Score 100
Code Size 2874 Byte
Status AC
Exec Time 28 ms
Memory 928 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 38
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 25 ms 676 KB
00_sample_02.txt AC 25 ms 796 KB
00_sample_03.txt AC 28 ms 732 KB
test_01.txt AC 25 ms 676 KB
test_02.txt AC 24 ms 928 KB
test_03.txt AC 25 ms 804 KB
test_04.txt AC 24 ms 804 KB
test_05.txt AC 25 ms 920 KB
test_06.txt AC 25 ms 676 KB
test_07.txt AC 25 ms 840 KB
test_08.txt AC 25 ms 804 KB
test_09.txt AC 24 ms 680 KB
test_10.txt AC 25 ms 804 KB
test_11.txt AC 24 ms 800 KB
test_12.txt AC 26 ms 800 KB
test_13.txt AC 24 ms 808 KB
test_14.txt AC 24 ms 808 KB
test_15.txt AC 25 ms 800 KB
test_16.txt AC 24 ms 808 KB
test_17.txt AC 25 ms 676 KB
test_18.txt AC 25 ms 800 KB
test_19.txt AC 25 ms 676 KB
test_20.txt AC 25 ms 676 KB
test_21.txt AC 25 ms 672 KB
test_22.txt AC 26 ms 804 KB
test_23.txt AC 27 ms 680 KB
test_24.txt AC 26 ms 676 KB
test_25.txt AC 27 ms 796 KB
test_26.txt AC 26 ms 804 KB
test_27.txt AC 27 ms 676 KB
test_28.txt AC 26 ms 796 KB
test_29.txt AC 26 ms 676 KB
test_30.txt AC 26 ms 672 KB
test_31.txt AC 24 ms 672 KB
test_32.txt AC 25 ms 804 KB
test_33.txt AC 26 ms 676 KB
test_34.txt AC 24 ms 676 KB
test_35.txt AC 26 ms 800 KB