WA On TEST#3 .. any help plz ???

Edited by author 11.09.2018 15:53

Edited by author 11.09.2018 15:53

it's just about implementation, the complexity is too high for these problem, imho

Learn something aboutDSU(disjoint-set-union

http://e-maxx.ru/algo/dsu

Edited by author 07.03.2013 23:32

I still WA on it!!!

In submission #8011723 I allocate queue of size only n, while for correct Ford-Bellman with a queue it should be up top m. Please, take a look into issue.

Я не понимаю, что здесь не правильного???
#include <iostream>
#include <string>
using namespace std;

int main() {
    string name[] = { "few", "several", "pack", "lots", "horde", "throng", "swarm", "zounds", "legion" };
    int input;
    cin >> input;
    if (input >=1 && input <= 4) cout << name[0];
    if (input > 4 && input <= 9) cout << name[1];
    if (input > 9 && input <= 19) cout << name[2];
    if (input > 19 && input <= 49) cout << name[3];
    if (input > 49 && input <= 99) cout << name[4];
    if (input > 99 && input <= 249) cout << name[5];
    if (input > 249 && input <= 499) cout << name[6];
    if (input > 499 && input <= 999) cout << name[7];
    if (input > 1000) cout << name[8];
    return 0;
}

Подскажите, пожалуйста!

All the X of the input are difference. (Maybe Y are different too. I haven't tried
That means, the following test won't exist:
-----
4
1 1
2 3
2 2
4 4
-----
This may be important for you to solve this question more easily (at least for me, my code won't work that situation and get AC in 0.031s though)
Good luck!

I tried hard and hard but was getting runtime error: access violation again and again because of not taking proper size of array. at last I used a[128*1024] by a solution of a discussion. and it worked. but how it was done? I mean I didn't get the clue line of question " A size of the input stream does not exceed 256 KB. "

can you help me?

Make sure you don't have spaces after any line

Current tests contain max 2 digits after decimal point. Could you specify it in the problem statement?

Else there is no solution to this problem. Without this limit specified a test can have a lot of digits after decimal point so that it is even impossible to read it within time limit.

Every connected component have to contain cycle of odd length (prove it).
Find such a cycle and solve.

use max=10**9
maybe, i'm just silly

lol kek

input file:
1
Isenbae Isen Isenbaeva

and, what what is your answer?

Edited by author 25.06.2013 19:22

Edited by author 25.06.2013 19:22

Edited by author 25.06.2013 19:23

#include <iostream>
#include <vector>
#include <cstring>
#include <queue>

using namespace std;

int N, M, S, T, A, B, P;
int total = 0;

struct Edge {
    int to, next;
    double prob;
} edges[100010];

int head[100010];
int parent[100010], dist[100010];
double prob[100010];

void addEdge(int start, int end, int p) {
    edges[total].to = end;
    edges[total].next = head[start];
    edges[total].prob = 1.0 - (double)p / 100.0;
    head[start] = total++;
}

// The most tricky part is the probability, we are looking for the probability
// of meeting Kraken in any route so it should be P(A|B), which equals to
// P(A) + P(B) - P(AB)
int main() {
    memset(head, -1, sizeof head);
    memset(parent, -1, sizeof parent);
    memset(dist, -1, sizeof dist);
    cin >> N >> M >> S >> T;
    for (int i = 0; i <= N; i ++)
        prob[i] = 0.0;

    for (int i = 1; i <= M; i ++) {
        cin >> A >> B >> P;
        addEdge(A, B, P);
        addEdge(B, A, P);
    }

    queue<int> q;
    q.push(S);
    dist[S] = 0 ;
    prob[S] = 1.0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int idx = head[u]; idx != -1; idx = edges[idx].next) {
            int v = edges[idx].to;
            double p = edges[idx].prob;
            if (dist[v] == -1 || (dist[v] == dist[u] + 1 && prob[v] < prob[u] * p)) {
                if (dist[v] == -1) {
                    q.push(v);
                }
                dist[v] = dist[u] + 1;
                prob[v] = prob[u] * p;
                parent[v] = u;
            }
        }
    }

    vector<int> path;
    for (int i = T; i != S; i = parent[i]) {
        path.push_back(i);
    }
    path.push_back(S);
    cout << path.size() << " ";
    printf("%.7f\n", 1.0 - prob[T]);
    for (int i = path.size() - 1; i >= 1; i --)
        cout << path[i] << " ";
    cout << path[0] << endl;

    return 0;
}

5
4
1 3 6 1

answer:3



Edited by author 29.05.2011 11:06

Done with queue + segment tree, AC in 0.265 on Visual C++ 2017

I have WA, but I don't guess at the feature of this test. Does anyone have a problem with this test? Please comment your trick.

#include <cstdio>
char ch, res;
int main (){
    while(scanf(" %c", &ch)!= EOF||(printf("%d\n", res)&0))
        res= (res*10+ ch-'0')%7;
}

outputon

YES

Edited by author 28.08.2018 23:32