Submission #595973


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define INF (1<<29)//INF
#define LLINF (1LL<<59)//LLINF
#define F first
#define S second
#define VS vector<string>
#define VI vector<int>
#define REP(i,s,n) for(int i=s;i<n;i++)//sからn未満の間iを回す
#define REPL(i,s,n) for(int i=s;i<=n;i++)
#define RREP(i,s,n) for(int i=s;i>=n;i--)//sからn以下の間iを回す
#define ALL(a) a.begin(),a.end()//ソートとかに使える sort(ALL(vec))のように
#define SET(a,c) memset(a,c,sizeof(a))//aをc(0or1)で初期化する
#define DEBUGONE(x) cout<<#x<<" : "<<x<<endl//デバックで一つの変数を表示
#define DEBUGTWO(x,y) cout<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<endl//デバックで二つの変数を表示
#define DEBUGTHREE(x,y,z) cout<<#x<<" : "<<x<<" "<<#y<<" : "<<y<<" "<<#z<<" : "<<z<<endl//デバックで三つの変数を表示
#define OUTFORONE(x,n)for(int i=0;i<n;i++){if(i!=0){cout<<" ";}cout<<x[i];}cout<<endl;
#define OUTFOR(x,n)for(int i=0;i<n;i++){cout<<x[i]<<endl;}
#define DEBUGFORONE(x,n)for(int i=0;i<n;i++){if(i!=0){cout<<" ";}cout<<#x<<"["<<i<<"]"<<" : "<<x[i];}cout<<endl;
#define DEBUGFOR(x,n)for(int i=0;i<n;i++){cout<<#x<<"["<<i<<"]"<<" : "<<x[i]<<endl;}
#define OUTONE(x) cout<<x<<endl//一つの変数を表示
#define OUTTWO(x,y) cout<<x<<" "<<y<<endl//二つの変数を表示
#define OUTTHREE(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl//三つの変数を表示
#define FILLN(a,n,c) fill_n(a,n,c)//aをnまでcで初期化する
#define FILL(a,n,c) fill(a,n,c)///aをnまでcで初期化する

typedef long long int64;
typedef pair<string,int> Psi;
typedef pair<int,int> Pii;
main(){
  int m;
  int ans;
  cin>>m;
  if(m<100){
    ans=0;
  }
  else if(m>=100&&m<=5000){
    m/=100;
    ans=m;
  }
  else if(m>=6000&&m<=30000){
    m/=1000;
    m+=50;
    ans=m;
  }
  else if(m>=35000&&m<=70000){
    m/=1000;
    m-=30;
    m/=5;
    m+=80;
    ans=m;
  }
  else if(m>70000){
    ans=89;
  }
  printf("%02d\n",ans);
}

Submission Info

Submission Time
Task B - 視程の通報
User reppuu77
Language C++ (G++ 4.6.4)
Score 100
Code Size 2022 Byte
Status AC
Exec Time 28 ms
Memory 1056 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 27 ms 944 KB
00_sample_02.txt AC 24 ms 1048 KB
00_sample_03.txt AC 26 ms 1048 KB
test_01.txt AC 26 ms 1052 KB
test_02.txt AC 24 ms 1052 KB
test_03.txt AC 26 ms 1052 KB
test_04.txt AC 25 ms 1052 KB
test_05.txt AC 26 ms 972 KB
test_06.txt AC 26 ms 1052 KB
test_07.txt AC 28 ms 1052 KB
test_08.txt AC 25 ms 1048 KB
test_09.txt AC 27 ms 1052 KB
test_10.txt AC 26 ms 1048 KB
test_11.txt AC 26 ms 1044 KB
test_12.txt AC 27 ms 864 KB
test_13.txt AC 26 ms 1052 KB
test_14.txt AC 25 ms 1052 KB
test_15.txt AC 26 ms 940 KB
test_16.txt AC 26 ms 1048 KB
test_17.txt AC 26 ms 1052 KB
test_18.txt AC 26 ms 1052 KB
test_19.txt AC 26 ms 1052 KB
test_20.txt AC 26 ms 1052 KB
test_21.txt AC 26 ms 1048 KB
test_22.txt AC 26 ms 944 KB
test_23.txt AC 26 ms 1052 KB
test_24.txt AC 26 ms 944 KB
test_25.txt AC 24 ms 940 KB
test_26.txt AC 26 ms 1052 KB
test_27.txt AC 26 ms 944 KB
test_28.txt AC 26 ms 1056 KB
test_29.txt AC 26 ms 1052 KB
test_30.txt AC 27 ms 940 KB
test_31.txt AC 26 ms 1052 KB
test_32.txt AC 27 ms 876 KB
test_33.txt AC 27 ms 944 KB
test_34.txt AC 27 ms 940 KB
test_35.txt AC 25 ms 940 KB