oj.uz

답안 #714781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714781 2023-03-25T09:14:23 Z Khizri Boarding Passes (BOI22_passes) C++17
0 / 100
 3 ms 540 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5,N=1e6+2;
int t=1,n,m,a[mxn],b[mxn],c[mxn],d[mxn],tree[mxn],MOD=1e9+7;
int add(int ind,int val){
    while(ind<=N){
        tree[ind]+=val;
        ind+=(ind&(-ind));
    }
}
int update(int l,int r,int val){
    add(l,val);
    add(r+1,-val);
}
int query(int ind){
    int ans=0;
    while(ind>0){
        ans+=tree[ind];
        ind-=(ind&(-ind));
    }
    return ans;
}
bool f(pair<int,pii>a,pair<int,pii>b){
    if(a.F==b.F){
        return a.S>b.S;
    }
    return a.F<b.F;
}
void solve(){
    string s;
    cin>>s;
    if(s.size()-1<3){
        cout<<setprecision(6)<<fixed<<0<<endl;
        return;
    }
    double k=s.size()-(s.size()%2);
    double ans=1.0*k*k/8;
    if(s.size()==4){
        cout<<setprecision(6)<<fixed<<1<<endl;
        return;
    }
    else{
        cout<<setprecision(6)<<fixed<<ans<<endl;
        return;
    }
}
int main(){
    //IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

passes.cpp: In function 'int add(int, int)':
passes.cpp:50:1: warning: no return statement in function returning non-void [-Wreturn-type]
   50 | }
      | ^
passes.cpp: In function 'int update(int, int, int)':
passes.cpp:54:1: warning: no return statement in function returning non-void [-Wreturn-type]
   54 | }
      | ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 284 KB found '100800.5000000000', expected '100800.5000000000', error '0.0000000000'
2 Correct 0 ms 212 KB found '0.0000000000', expected '0.0000000000', error '-0.0000000000'
3 Correct 1 ms 212 KB found '0.0000000000', expected '0.0000000000', error '-0.0000000000'
4 Correct 0 ms 212 KB found '1.0000000000', expected '1.0000000000', error '0.0000000000'
5 Correct 1 ms 300 KB found '124002.0000000000', expected '124002.0000000000', error '0.0000000000'
6 Incorrect 3 ms 540 KB 1st numbers differ - expected: '772893586.0000000000', found: '772913244.5000000000', error = '0.0000254349'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 1st numbers differ - expected: '1.0000000000', found: '4.5000000000', error = '3.5000000000'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 1st numbers differ - expected: '1.0000000000', found: '4.5000000000', error = '3.5000000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 284 KB found '100800.5000000000', expected '100800.5000000000', error '0.0000000000'
2 Correct 0 ms 212 KB found '0.0000000000', expected '0.0000000000', error '-0.0000000000'
3 Correct 1 ms 212 KB found '0.0000000000', expected '0.0000000000', error '-0.0000000000'
4 Correct 0 ms 212 KB found '1.0000000000', expected '1.0000000000', error '0.0000000000'
5 Correct 1 ms 300 KB found '124002.0000000000', expected '124002.0000000000', error '0.0000000000'
6 Incorrect 3 ms 540 KB 1st numbers differ - expected: '772893586.0000000000', found: '772913244.5000000000', error = '0.0000254349'
7 Halted 0 ms 0 KB -