#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
#define N 900000
struct seq
{
    int l;
    int r;
};
seq se[N];
int m;
bool cmp(const seq &s1,const seq &s2)
{
    if(s1.l==s2.l)
        return s1.r>s2.r;
    return s1.l<s2.l;
}
int main()
{
    //while(scanf("%d",&m)!=EOF)
    //{
    scanf("%d",&m);
        int left,right;
        queue<int>que;
        while(!que.empty())que.pop();
        int i=0,j;
        while(scanf("%d%d",&left,&right))
        {
            if(left==0&&right==0)break;
            se[i].l=left;
            se[i].r=right;
            i++;
        }
        sort(se,se+i,cmp);
        int rightf=0;
        int maxlen=0;
        int num=0;
        int p=-1;
        int ff=0;
        for(j=0;j<i;j++)
        {

            if(se[j].l<=rightf&&se[j].r-rightf>maxlen)
            {
                maxlen=se[j].r-rightf;
                p=j;
            }
            else if(p!=-1&&maxlen>0)
            {
                que.push(p);
                rightf=rightf+maxlen;
                maxlen=0;
                num++;
                j=j-1;
            }
            if(rightf>=m)
            {
                ff=1;
                break;
            }
        }
        if(maxlen>0)
        {

            rightf=rightf+maxlen;
            maxlen=0;
            num++;
            if(rightf>=m)
            {
                que.push(p);
                ff=1;
            }
        }
        if(ff)
        {
            printf("%d\n",num);
            while(!que.empty())
            {
                int top=que.front();
                printf("%d %d\n",se[top].l,se[top].r);
                que.pop();
            }
        }
        else
            printf("No solution\n");
    //}
    return 0;
}

AC!!!! :D

Don't use overflowing (int64 or int) in your hash function! :D


Edited by author 10.08.2012 18:07

Could you please help me? Where is my mistake? I got Time Limit Exceeded on test 4.


Edited by author 28.07.2012 15:54

You can use stable_sort at C++.

input 1
3
6.0000
3.0000
output 1
6

input 2
3
6.1000
3.0000
output 2
7

input 3
3
8.0000
3.0000
output 3
9

Please help, I can't find a problem.


#include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
    const short max=255;
    int n;
    char a[1001][max],t[2];
    scanf("%i",&n);
    int k=0;
    cin.getline(t,max);
    for (int i=0;i<n;++i)
        {
        cin.getline(a[i],max);
        for (int j=0;j<i;++j)
            {
            bool r=1;
            for (int t=0;t<max;++t)
                {
                if (!(a[i][t]==a[j][t]))
                    {
                    r=0;
                    break;
                    }
                }
            if (r)
                {
                ++k;
                break;
                }
            }
        }
    printf("%i\n",k);
}


Edited by author 08.08.2012 17:56

Just use the countsort:)

If input is 1212131 , what is output?

Just push all symbols at one position back..
J -> I
C -> B
N -> ???

Edited by author 30.07.2012 13:46

This is my code:

{$APPTYPE CONSOLE}
uses
  SysUtils;
var
   s: string;
   f: boolean;
   newstr: string;
   i: integer;

begin
 //assign(input, 'input.txt'); reset(input);
// assign(output, 'output.txt'); rewrite(output);

 f:=true;
  while not eof do
   begin
    readln(s);
    newstr:='';
    s:=LowerCase(s);
    // process

     for i:=1 to length(s) do
      begin
       if f and (s[i] <> ' ') and (s[i] <> ',') and (s[i] <> '!')
            and (s[i] <> '?') and (s[i] <> '.') then
       begin
        newstr:=newstr + UpCase(s[i]);
        f:= false;
       end
       else newstr:=newstr + s[i];

       if (s[i] = '?') or (s[i] = '!') or (s[i] = '.') then
             f:=true;
      end;
     writeln(newstr);
   end;

end.

type
list = array[1..21] of longint;

var n,i,w1,w2,d:integer;
w:list;

begin
read(n);
d:=0;
For i:=1 to n do read(w[i]);
If n=1 then begin write(w[1]); halt; end;
For i:=1 to n div 2 do begin
  If w1>w2 then w2:=w2+abs(w[i+d]-w[i+d+1]) else w1:=w1+abs(w[i+d]-w[i+d+1]);
  d:=d+1;
  end;
If n mod 2=0 then write(abs(w1-w2)) else write(w[n]-abs(w1-w2));
end.

1
1
is correct(1).

5
1 8 13 27 14
is correct(3).
Test #5 is correct. Where is the mistake?

Edited by author 08.08.2012 01:02

If you have WA, you must use long long(or int64 in Pascal).And don't use sum/3>n,use sum>n*3.After that you have AC.
По русски.
Не используйте типы int(или integer). Используйте типы int64(или long long). При сравнение не сумма/3>выхода,а сумма>выход*3. Желаю всем красивых AC!

P.S. Sorry for bad English.

I've got an AC.
Tests:

_________
1
0
./1017
2
0
./1017
3
1
./1017
4
1
./1017
5
2
./1017
6
3
./1017
7
4
./1017
8
5
./1017
9
7
./1017
10
9
./1017
11
11

import java.util.Scanner;

public class KVoprosuOSporte {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[][] a = new int[n][n];
        int k = 0;
        int[] b = new int[n * n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                a[i][j] = in.nextInt();
                b[k] = a[i][j];
                k++;
            }
        }
        for (int i = 0; i < b.length - 1; i++) {
            for (int j = i + 1; j < b.length; j++) {
                if (b[i] > b[j]) {
                    int tmp = b[i];
                    b[i] = b[j];
                    b[j] = tmp;
                }
            }
        }
        for (int i = 0; i < b.length; i++) {
            System.out.println(b[i]);
        }
    }
}

where is my mistake? falls on 5th

var i,nr,n,k,c:integer;
begin
read(n,k);
nr:=trunc(n/2);
if (k>nr) then
begin
for i:=nr+1 to k-1 do
inc(c);
end;
if (k<nr) then
begin
for i:=k+1 to nr do
inc(c);
end;
write(c);
end.

import java.util.Scanner;
public class Hanoi_Tower  {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int d[] = new int [n+1];
        for (int i = 1; i <= n; i++) {
            d[i] = sc.nextInt();
        }
        int x =n%2;
        int a[][] ={{3, 1, 2, 3}, {2, 1, 3, 2}};
        double ans = 0;
        for (int i = n; i > 0; i--) {
            int y = (i+x)%2;
            double rep = (ans/Math.pow(2, i) + 1)%3;
                if (d[i] != a[y][(int)rep]){
                    if (d[i] != a[y][(int)(rep+1)]){
                        System.out.println("-1");
                        return;
                    }
                    ans += Math.pow(2, (i-1));
                }
        }
        System.out.printf("%.0f",ans);
    }
}

Edited by author 06.08.2012 17:08

#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

bool compar1(pair<string, int> a, pair<string,int> b)
{
     if (a.second>b.second) return true;
     else return false;
}

int main(int argc, char *argv[])
{
    int n = 0;
    cin >> n;
    vector<pair<string, int> > v(n);
    for (int i = 0; i<n; i++) {
        string tmp;
        int num;
        cin >> tmp;
        cin >> num;
        v.push_back(make_pair(tmp, num));
    }
    sort(v.begin(), v.end(), compar1);
    int m = 0;
    cin >> m;
    for (int i = 0; i<m; i++) {
        string str;
        cin >> str;
        for (int j = 0; j<n; j++) {
            if (v[j].first.find(str)==0&&j<10) {
               cout << v[j].first << endl;
            }
        }
        if (i!=m-1) cout << endl;
    }
    system("PAUSE");
    return 0;
}