Submission #1870270


Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 20)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl

//ここから編集する
vector<int> D;
vector<bool> used;

bool nibu(int m) {
//    used = vector<bool>(D.size(), false);
//    vector<int> kouho;
//    rep(i,0,D.size()){
//        if(!used[i]){
//            kouho.push_back(D[i]);
//            kouho.push_back(24-D[i]);
//        }
//    }
//    int cur = 0;
//    int cnt = 0;
//    while(cnt < D.size()){
//
//    }
    int time[25] = {};
    rep(i,0,D.size()){
        time[D[i]]++;
        time[24 - D[i]]++;
    }
    int cur = 0;
    int cnt = 0;
    while(cnt < D.size()){
        int e = -1;
        rep(i,cur+m,25){
            if(time[i] > 0){
                e = i;
                break;
            }
        }
        if(e == -1) return false;
        time[e]--;
        time[24-e]--;
        cur = e;
        cnt++;
    }
    return true;
}

int main() {
    int n;
    cin >> n;
    rep(i, 0, n) {
        int tmp;
        cin >> tmp;
        D.push_back(tmp);
    }
    sort(all(D));
    int ok = 0;
    int ng = 25;
    while(ng - ok > 1){
        int mid  = (ok + ng)/2;
        if(nibu(mid)){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    cout << ok << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Time Gap
User homesentinel
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2656 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 35
WA × 14
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt WA 1 ms 256 KB
01-02.txt WA 1 ms 256 KB
01-03.txt WA 1 ms 256 KB
01-04.txt WA 1 ms 256 KB
01-05.txt WA 1 ms 256 KB
01-06.txt WA 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 1 ms 256 KB
01-12.txt AC 1 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 1 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt WA 1 ms 256 KB
01-18.txt AC 1 ms 256 KB
01-19.txt AC 1 ms 256 KB
01-20.txt AC 1 ms 256 KB
01-21.txt AC 1 ms 256 KB
01-22.txt WA 1 ms 256 KB
01-23.txt WA 1 ms 256 KB
01-24.txt AC 1 ms 256 KB
01-25.txt WA 1 ms 256 KB
01-26.txt WA 1 ms 256 KB
01-27.txt AC 1 ms 256 KB
01-28.txt AC 1 ms 256 KB
01-29.txt AC 1 ms 256 KB
01-30.txt AC 1 ms 256 KB
01-31.txt AC 1 ms 256 KB
01-32.txt AC 1 ms 256 KB
01-33.txt AC 1 ms 256 KB
01-34.txt AC 1 ms 256 KB
01-35.txt AC 1 ms 256 KB
01-36.txt AC 1 ms 256 KB
01-37.txt AC 1 ms 256 KB
01-38.txt AC 1 ms 256 KB
01-39.txt AC 1 ms 256 KB
01-40.txt WA 1 ms 256 KB
01-41.txt AC 1 ms 256 KB
01-42.txt AC 1 ms 256 KB
01-43.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt WA 1 ms 256 KB