I wish they made clarification

"...solutions for which the outcome has changed."

Is the outcome change
"WA 6" -> "WA 8"
a real change on which a letter is sent?

Or only outcome code (WA, AC, ...) make sense, not a test number??

Edited by author 10.10.2009 14:54

Edited by author 10.10.2009 14:54

Try this:

2
AAA WA 7
BBB AC

Answer is 1 2

Here's the test that helped me

5
A AC
B AC
D TL 7
D TL 7
D TL 6
1 3

Here is my code. Can anyone help me, please.
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>
//#include <conio.h>

using namespace std;

#define oo 1000000000
#define fi first
#define se second
#define sqr(a) ((a)*(a))
#define FR(i,n) for (int i = 0; i < (n); i++)
#define DN(i,a) for(int i = (a)-1; i >= 0; i--)
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define DOWN(i,a,b) for(int i = (a); i >= (b); i--)
#define FORV(i,a) for(typeof(a.begin()) i = a.begin(); i != a.end(); i++)

typedef pair<int, int> PII;
typedef vector<int> VI;

map<string, int> gavemin, gavemax;

int main () {
    int n, resmin = 0, resmax = 0;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string name, state;
        cin >> name >> state;
        if (state != "AC") {
            int x;
            cin >> x;
            if (x >= 6 && gavemax[name] == 0) {
                gavemax[name] = 1;
                resmax++;
            }
            if (x == 7 && gavemin[name] == 0) {
                gavemin[name] = 1;
                resmin++;
            }
        } else if (gavemax[name] == 0) {
                resmax++;
                gavemax[name] = 1;
        }
    }
    cout << resmin << ' ' << resmax << endl;
    return 0;
}
Thanks.

Edited by author 19.08.2011 19:19

Edited by author 10.07.2011 14:49

Edited by author 10.07.2011 14:49

3
tiancaihb WA 6
tiancaihb TL 7
tiancaihb ML 4

-->1 1

or
2
tiancaihb WA 6
tiancaihb TL 7

-->1 1
or
2
tiancaihb WA 7
tiancaihb TL 6

Maybe helpful for a few people... I was trapped in test 7 of this (REAL) problem.

whats wrong could you send some tests pls
if you want source I'll give it

I insert to my array only the final verdict of author, then start to counting;
if WA,ML,TL 7 min++,max++
if AC,WA,ML,TL 6 max++
print min,max
Why WA13

Edited by author 19.10.2009 22:28

2
[SPbSU_ITMO]_WiNGeR TL 7
Milanin_(TNU) AC

3
[SPbSU_ITMO]_WiNGeR TL 7
Milanin_(TNU) AC
Milanin_(TNU) WA 7

3
[SPbSU_ITMO]_WiNGeR TL 6
Milanin_(TNU) AC
Milanin_(TNU) WA 7

3
Milanin_(TNU) WA 6
Milanin_(TNU) WA 6
Milanin_(TNU) WA 7

Thanks

Why is this code crashing on test #3?!
Please give me test 3. My e-mail: muzaffar-17@bk.ru


import java.util.HashSet;
import java.util.Locale;
import java.util.Scanner;
import java.util.Set;

public class m1718 {
    public static void main(String[] args)  {
        Locale.setDefault(Locale.US);
        Scanner sc=new Scanner(System.in);
        int n=Integer.parseInt(sc.nextLine());
        Set<String> set=new HashSet<String>();
        String[][] nick=new String[n][10];
        int[] d=new int[n];
        for (int i = 0; i <n; i++) {
            nick[i]=sc.nextLine().split(" ");
            if(nick[i][1].equals("AC")) d[i]=0;
            else d[i]=Integer.parseInt(nick[i][2]);
        }int min=0;
        for (int i = 0; i <n; i++) {
            if(d[i]==0)set.add(nick[i][0]);
            if(d[i]>=6)set.add(nick[i][0]);
            if(d[i]==7)min++;
        }
        System.out.println(min+" "+set.size());
    }

}

import java.util.HashSet;
import java.util.Locale;
import java.util.Scanner;
import java.util.Set;

public class m1718 {
    public static void main(String[] args)  {
        Locale.setDefault(Locale.US);
        Scanner sc=new Scanner(System.in);
        Set<String> maxS=new HashSet<String>();
        Set<String> minS=new HashSet<String>();
        int n=Integer.parseInt(sc.nextLine());
        String[] name=new String[n+1];
        String[] s=new String[n+1];
        int[] d=new int[n+1];
        for (int i = 0; i < n; i++) {
            name[i]=sc.next();
            s[i]=sc.nextLine();s[i].trim();
            if(s[i].charAt(1)=='A'){
                d[i]=0;
            }else {
                String[] s1=s[i].split(" ");
                d[i]=Integer.parseInt(s1[2]);
            }
        }
        for (int i = 0; i <n; i++) {
            if(d[i]==0) maxS.add(name[i]);
            if(d[i]>=6)maxS.add(name[i]);
            if(d[i]==7)minS.add(name[i]);
        }
        System.out.println(minS.size()+" "+maxS.size());
    }

}

Edited by author 02.11.2009 16:22

it's very important for understanding the condition!

#include <iostream>
#include <string>
#include <algorithm>
#include <map>

using namespace std;

int main()
{
    int n;
    map <string , string> user;
    map <string , string > ::iterator it;
    string name , er , ti ;
    cin >> n;
    for(int i = 0 ; i < n ; i++)
    {
        cin >> name >> er;

        if(er == "CE")
        {
            it = user.find(name);
            if(it == user.end())
                user[name] = "0";
        }

        else if(er == "AC")
        {
            user[name] = "a";
        }

        else
        {
            cin >> ti;
            it = user.find(name);
                if(it != user.end())
                    user[name] = max(ti, it->second);
                else
                    user[name] = ti;
        }
    }

    //cout << " ^^^ " << user.size() << endl;
    it = user.begin();
    int mx = 0 , mn = 0;
    while(it !=  user.end())
    {
        //cout << "first == " << it->first << " second == " << it->second << endl;
        if(it->second == "6" || it->second == "a")
            mx++;
        if(it->second == "7")
        {
            mn++;
            mx++;
        }
        it++;
    }
    cout << mn << " " << mx << endl;

    return 0;
}

what the wrong !?

"The outcomes which differ only in test number are considered different."It means that the maximum number of tests passed are different?

Edited by author 10.10.2009 17:16

Edited by author 10.10.2009 17:18

I can not understand problem statement.
Please explain me it

could be some author presented at the input twice?