codechef Turbo Sort 题解

Input

t – the number of numbers in list, then t lines follow [t <= 10^6].

Each line contains one integer: N [0 <= N <= 10^6]

Output

Output given numbers in non decreasing order.

Example

Input:

5
5
3
6
7
1

Output:

1
3
5
6
7

大数据的排序,输入和输出。

一开始使用了cout,那么就超时了,后来换用printf,结果过了,速度快上五倍以上。 putchar应该更加快,然后更快的就是使用buffer了,使用函数fwrite.

本oj网站首先学到的就是数据输入输出问题了。

#include<stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;

int TurboSort()
{
	int T = 0, num = -1, c = 0, j = 0;
	scanf("%d\n", &T);
	char buffer[1000000];
	int *A = new int[T];
	while ((c = fread(buffer, 1, 1000000, stdin)) > 0)
	{
		for (int i = 0; i < c; i++)
		{
			if (buffer[i] == ‘\n‘)
			{
				A[j++] = num;
				num = -1;
			}
			else
			{
				if (-1 == num) num = buffer[i] - ‘0‘;
				else num = num * 10 + buffer[i] - ‘0‘;
			}
		}
	}
	if (-1 != num) A[T-1] = num;
	sort(A, A+T);

	for (int i = 0; i < T; i++)
	{
		printf("%d\n", A[i]);//使用cout会超时,最少慢5倍
	}
	delete [] A;
	return 0;
}

codechef Turbo Sort 题解,布布扣,bubuko.com

时间: 2024-10-23 20:13:33

codechef Turbo Sort 题解的相关文章

【CodeChef】Turbo Sort

题目链接:Turbo Sort 用java自带O(NlogN)的排序就可以,java要特别注意输入输出.输入用BufferedReader,输出用printWriter.printWriter的速度比System.out快很多,参考StackOverflow. 代码: 1 import java.io.BufferedOutputStream; 2 import java.io.BufferedReader; 3 import java.io.InputStreamReader; 4 impor

Codechef Nuclear Reactors 题解

There are K nuclear reactor chambers labelled from 0 to K-1. Particles are bombarded onto chamber 0. The particles keep collecting in the chamber 0. However if at any time, there are more than N particles in a chamber, a reaction will cause 1 particl

codechef Cleaning Up 题解

After a long and successful day of preparing food for the banquet, it is time to clean up. There is a list of n jobs to do before the kitchen can be closed for the night. These jobs are indexed from 1 to n. Most of the cooks have already left and onl

codechef Permutation Cycles 题解

We consider permutations of the numbers 1,..., N for some N. By permutation we mean a rearrangment of the number 1,...,N. For example 2  4  5  1  7  6  3  8 is a permutation of 1,2,...,8. Of course, 1  2  3  4  5  6  7  8 is also a permutation of 1,2

codechef Top Batsmen题解

A cricket team consists of 11 players and some are good at batting, others are good at bowling and some of them are good at both batting and bowling. The batting coach wants to select exactly K players having maximum possible sum of scores. Given the

codechef Birthday Candles 题解

Birthday Candles The chef is preparing a birthday cake for one of his guests, and his decided to write the age of the guest in candles on the cake. There are 10 types of candles, one for each of the digits '0' through '9'. The chef has forgotten the

codechef Cutting Recipes题解

Cutting Recipes The chef has a recipe he wishes to use for his guests, but the recipe will make far more food than he can serve to the guests. The chef therefore would like to make a reduced version of the recipe which has the same ratios of ingredie

HDU 1425 sort 题解

选择出数列中前k个最大的数. 这里因为数据特殊,所以可以使用hash表的方法: #include <cstdio> #include <algorithm> #include <stdlib.h> #include <limits> using namespace std; const int SIZE = 1000005; const int SMALL = -500000; bool arr[SIZE]; int main() { int n, m, a

codechef Prime Palindromes 题解

给定一个数,求一个新数要大于等于这个数,而这个新数既要是palindromes回文又要是prime素数. 题目很简单,有人都使用取巧的方法保存好结果直接查表. 或者暴力法求解. 这里不使用保存表的方法,也不要用暴力法.- 这些方法都不好. 使用的技巧有: 1 而是使用next palindrome的技巧,只需要O(n),n是数位,可以认为是常数了. 2 判断素数的方法,时间效率是O(sqrt(n)), n是数值大小,如果是重复判断很多数是否是素数是有办法优化的,但是如果是单个素数判断的话,我还想