Why time limit exceeded on test#9?

Does someone knows what is the 7th test?
Than you very much!

//Solution By Omyrzak Meirambek
#include <iostream>
#include <fstream>
#include <cstdio>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <utility>
#include <cstdlib>
#include <algorithm>
#include <ctime>
#include <vector>
#include <map>
using namespace std;
#define fname ""
#define ull unsigned long long
#define ll long long
#define INF 1000*1000*1000
const int N = 20000;
map <int, int> q;
int n, x, res = 0, m;
int main ()
{
    #ifndef ONLINE_JUDGE
    freopen ("in","r",stdin);
    freopen ("out","w",stdout);
    #endif

    cin >> n;
    for (int i = 1; i <= n; i ++ ) {
        cin >> x;
        q[x] = 1;
    }
    cin >> m;

    for (int i = 1; i <= m; i ++ ) {
        cin >> x;
        res += q[x];
    }

    cout << res;

    return 0;
}

Edited by author 04.08.2012 18:24

Should I use Dijkstra's algorithm several times for each friend or just floyd-warshall?

Please help me, guys, I don't know what's the problem:(


#include <iostream>

using namespace std;


int lft[320], rght[320];

double timeleft[320], timeright[320];

double const eps = 0.0000001;

int main(){
    int n,m;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> lft[i];
        timeleft[i] = (lft[i] + 5.000)*9/50;
    }
    cin >> m;
    for(int i = 1; i <= m; i++){
        cin >> rght[i];
        timeright[i] = (rght[i]+5.000)*9/50 - 36.000/25;
    }

    double ans = 1000000000;

    if(lft[1] >= 8 && (rght[1] >= 16  || (rght[1] <= 3 && (rght[2] >= 16 || m == 1)))){
        cout << 0;
        return 0;
    }



    for(int i = 1; i <= n; i++){
        double cur = timeleft[i];
        bool b = 0;
        if(lft[i+1] - lft[i] >= 13 || lft[i+1] == 0){

            for(int j = 1; j <= n; j++){
                double temp = rght[j] - (cur + 36.000/25)*200.000/36;
                if(temp > -5 + eps && temp + eps < 8)
                    b = 1;
            }

        }
        else b = 1;
        if(!b && cur + eps < ans)
            ans = cur;
    }

    for(int i = 1; i <= m; i++){
        double cur = timeright[i];
        bool b = 0;
        if(rght[i+1] - rght[i] >= 13 || rght[i+1] == 0){

            for(int j = 1; j <= n; j++){
                double temp = lft[j] - cur*200.000/36;
                if(temp - eps > -5  && temp + eps < 8)
                    b = 1;
            }

        }
        else b = 1;
        if(!b && cur + eps < ans)
            ans = cur;
    }

printf("%.9f",ans);
return 0;
}

Don't forget cases when Ilya and Alesha are on same way (from root to berth).
In my solution lca of positions could be less than they was :)

For example:

4 4 4 1 2 0
output: YES

4 2 4 7 7 2
output: YES

Edited by author 03.08.2012 18:32

Hello. What about test 15? Can you give it?

Why I can compile by gcc (UBUNTU),but I always make mistakes here?

Can you tell me why I am wrong in test 2 if you was wrong in test2 once?

The first test where token != used.

why is it so?

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
    int value[]={ 10, 50, 100, 500, 1000, 5000 };
    int num[5],sum=0;
    int price;
    for(int i=0;i<6;i++)
    {
        cin>>num[i];
        sum+=num[i]*value[i];
    }
    cin>>price;
int i=0;
while(num[i]==0)
++i;
int lol=0,lol1=0;
while(lol*price<=sum-value[i])
    ++lol;
int j=0;
int k=0;
while((lol+k)*price<=sum)
{
    ++lol1;
    ++k;
}
cout<<lol1<<endl;
while((lol+j)*price<=sum)
{
    cout<<lol+j<<" ";
    ++j;
}
}

Почему написано погрешность не должна превосходить 10е−6, при том что в примере выводят с точностью в 10е-1? И при какой скорости закладывает уши? Больше х это х+10е-6, или может это не учитывать?

Edited by author 29.10.2011 15:28

If you have WA1 just skip all #10 and #13 symbols from input data!

import java.util.Scanner;
public class Main {
    public static void main(String args[]) {
        try {
            Scanner in = new Scanner(System.in);

            int[] group = new int[in.nextInt()];
            for(int i=0; i<group.length; i++) {
                group[i] = in.nextInt();
            }
            int per;
            for(int i=0; i<group.length - 1; i++) {
                for(int j=1; j<group.length; j++) {
                    if (group[i] >= group[j]) {
                        per = group[i];
                        group[i] = group[j];
                        group[j] = per;
                    }
                }
            }
            int sum = 0;
            for(int i=0; i<group.length/2 + 1; i++) {
                sum += group[i]/2 + 1;
            }
            System.out.println(sum);
            in.close();
        }
        catch(Exception e) {
            System.out.println("Error");
        }
    }
}

I'm calculating for every interval the max element with binary indexed tree in log(n) time. But still got TL on test 2. Is it ok NlogM to be slow ?

Edited by author 20.11.2011 15:23