Submission #1798390

---

Source Code Expand

#include <vector>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <typeinfo>
#include <queue>
#include <set>
#include <sstream>

using namespace std;

#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).begin(),(c).end(),std::greater<int>())
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
#define MAX 200000
#define SENTINEL 10000000000
typedef long long ll;

ll L[MAX/2+2],R[MAX/2+2];

void minimum_cost(){
	//#define MAX 1000//maximum size
	//static const int MAX = 1000;
	static const int VMAX = 10000;//maximum weight
	int n, A[MAX],s,i;
	int B[MAX],T[VMAX+1];
	//cout << MAX << endl;

	cin >> n;
	s = VMAX;
	for(int i=0;i<n;i++){
		cin >> A[i];
		s = min(s,A[i]);//minimum value in A
	}
	//int ans = minimum_cost_solver(MAX);
	int ans = 0;
	bool V[MAX];
	for(i=0;i<n;i++){
		B[i]=A[i];
		V[i]=false;
	}
	sort(B,B+n);
	for(i=0;i<n;i++){
		T[B[i]]=i;//index in A, where the weight is B[i]
	}
	for(i=0;i<n;i++){
		if(V[i]) continue;//whether the index i is in an at least one loop or not
		int cur = i;//current index (ar first, start index of a loop)
		int S=0;//sum of weights in the loop
		int m=VMAX;//minimum weight in the loop
		int an = 0;//counts of the loop
		while(1){
			V[cur] = true;
			an++;
			int v = A[cur];//weight of A[current]
			m = min(m,v);
			S += v;
			cur = T[v];
			if (V[cur]) break;//index cur is in the loop
		}
		ans += min(S + (an-2)*m, m + S + (an+1)*s);
	}

	cout << ans << endl;

}

void c3_3(){
  int n,k;
  double res = 0.0;
  cin >> n >> k;
  std::vector<int> r;
  int tmp;
  REP(i,n){
    cin >> tmp;
    r.push_back(tmp);
  }
  SORT(r);
  FOR(i,n-k,n){
    res = (res + r[i]) * 0.5;
  }
  printf("%f\n",res);
  //printf("%.6f\n",res);
}

void b_4(){
  char X[16];
  REP(i,16){
    cin >> X[i];
  }
  REP(i,4){
    REP(j,4){
      cout << X[15 - (i*4 + j)] << " ";
    }
    cout << endl;
  }
}


  void c3(){
    int n;
    cin >> n;
    int s = n % 30;
    int last = s / 5;
    int moving = last + 1;

    int amari = s % 5;
    int res[6];
    REP(i,5){
      res[i] = last + i + 1;
      if(res[i] > 6){
        res[i] = res[i] - 6;
      }
    }
    if(last == 0){
      last = 6;
    }
    res[5] = last;
    int tmp;
    REP(i,amari){
      tmp = res[i];
      res[i] = res[i+1];
      res[i+1] = tmp;
    }
    REP(i,6){
      cout << res[i];
    }
    cout << endl;
  }
 
int main(){
	//countingsort();
	//mergesort_count();
	//tmp();
	//minimum_cost();
  //hoge();
  //c3_3();
  //b4();
  c3();
	return 0;
}

Submission Info

Judge Result