/*
Copyright (c) 2006 Joseph Gleason

Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

Current versions of this and other code can be downloaded at:
http://gleason.cc/

*/
package cc.glsn.v15;

import java.util.LinkedList;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;

public class Tournament
{

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        new Tournament();

    }
    
    int NumPlayers;
    TreeMap<Integer,PlayerInfo> Players;
    TreeSet<PairMatch> Matches;
    LinkedList<PairMatch> History;
    Random PRNG;
    
    public Tournament()
    {
        Scanner Scan=new Scanner(System.in);
        
        System.out.print("Number of players: ");
        NumPlayers=Scan.nextInt();
        PRNG=new Random();
        Matches=new TreeSet<PairMatch>();
        Players=new TreeMap<Integer,PlayerInfo>();
        History=new LinkedList<PairMatch>();
        for(int i=0; i<NumPlayers; i++)
        {
            Players.put(i,new PlayerInfo(i));
        }
        System.out.println("" + NumPlayers + " added.");
        Scan.nextLine();
        while(true)
        {
            try
            {
                doCommand(Scan);
            }
            catch (Exception e)
            {
                System.out.println("That was pretty exceptional, jerk. " + e);
                //e.printStackTrace();
            }
        }
        
        
    }
    
    String getPlayerName(int a)
    {
        return Players.get(a).Name;
    }
    
    int getPlayerNumber(String S)
    {
        S=S.toLowerCase();
        for(int i=0; i<NumPlayers; i++)
        {
            if (Players.get(i).Name.toLowerCase().equals(S)) return i;
        }
        try
        {
            int z=new Integer(S);
            return z;
        }
        catch(NumberFormatException e)
        {
            System.out.println("Unable to match " + S + " to a player.");
        }
        
        return -1;
    }
    
    
    private void doCommand(Scanner Scan) throws java.util.NoSuchElementException
    {
        
        System.out.print(": ");
        String Line=Scan.nextLine();
        
        if (Line.length()==0) Line="help";
        Scanner LineScan=new Scanner(Line);
        String Command=LineScan.next();
        
        if ((Command.equals("help")) || (Command.equals("h")) || (Command.equals("?")))
        {
            System.out.println("Commands: " );
            System.out.println("  name [player] [new_name] - renames player to name");
            System.out.println("  score                    - displays the current scoreboard");
            System.out.println("  history                  - displays the match history");
            System.out.println("  match [A] [B] [winner]   - reports a match between players A and B");
            System.out.println("  avail [A] [B] [C] ...    - for a given list of players, shows which matches to start");
            System.out.println();
            System.out.println(" For all options that take a player, the player be specified with either:");
            System.out.println("  - the player name, as specified with 'name' commands");
            System.out.println("  - the player id number, as shown on the scoreboard");
                    
        }
        else if (Command.equals("history"))
        {
            System.out.println("Match History (" + History.size() + " matches): ");
            for(PairMatch P : History)
            {
                System.out.println("Match " + getPlayerName(P.A) + " vs " + getPlayerName(P.B) + " winner: " + getPlayerName(P.Winner));
                
            }
        }
        else if (Command.equals("name"))
        {
            int Player=getPlayerNumber(LineScan.next());
            String NewName=LineScan.next();
            if (!validPlayer(Player)) return;
            System.out.println("" + Players.get(Player).Name + " renamed to " + NewName);
            Players.get(Player).Name=NewName;
        }
        else if (Command.equals("score"))
        {
            for(int i=0; i<NumPlayers; i++)
            {
                System.out.println(Players.get(i).toString());
            }
        }
        else if (Command.equals("match"))
        {
            int a=getPlayerNumber(LineScan.next());
            int b=getPlayerNumber(LineScan.next());
            int winner=getPlayerNumber(LineScan.next());
            
            if (!validPlayer(a)) return;
            if (!validPlayer(b)) return;
            if (!validPlayer(winner)) return;
            if ((winner != a) && (winner != b))
            {
                System.out.println("Winner not one of the players.");
                return;
            }
            
            System.out.println("Adding match: " + getPlayerName(a) + " vs " + getPlayerName(b) + " winner " + getPlayerName(winner));
            addMatch(a,b,winner);
            updateScore();
        }
        else if (Command.equals("avail"))
        {
            TreeSet<Integer> Avail=new TreeSet<Integer>();
            while(LineScan.hasNext())
            {
                int pidx=getPlayerNumber(LineScan.next());
                if (validPlayer(pidx)) Avail.add(pidx);
                
            }
            new AvailSearch(Avail);
        }
        else
        {
            System.out.println("Unknown command: " + Command);
        }
        
    }
    
    
    
    
    private void updateScore()
    {
        System.out.println("Updating scores...");
        for(int i=0; i<NumPlayers; i++)
        {
            Players.get(i).Games=0;
            Players.get(i).Loss=0;
            Players.get(i).Win=0;
        }
        
        for(PairMatch P : Matches)
        {
            Players.get(P.A).Games++;
            Players.get(P.B).Games++;
            Players.get(P.getWinner()).Win++;
            Players.get(P.getLoser()).Loss++;
            
        }
        
        
    }
    
    
    
    
    private boolean validPlayer(int a)
    {
        if ((a<0) || (a>=NumPlayers))
        {
            System.out.println("I pity the fool who considers " + a + " a valid player number.");
            return false;
        }
        return true;
    }
    
    private boolean hasMatch(int a, int b)
    {
        PairMatch PM=new PairMatch(a,b);
        
        if (Matches.contains(PM)) return true;
        
        return false;
        
    }
    private void addMatch(int a, int b, int winner)
    {
        PairMatch PM=new PairMatch(a,b);
        PM.Winner=winner;        
        if (Matches.contains(PM))
        {
            System.out.println("Clearing old match");
            Matches.remove(PM);
            
        }
        Matches.add(PM);        
        History.add(PM);
    }
    
    class PairMatch implements Comparable
    {
        int A;
        int B;
        
        int Winner;
        
        int getWinner()
        {
            return Winner;
        }
        int getLoser()
        {
            if (A!=Winner) return A;
            if (B!=Winner) return B;
            
            System.out.println("NOOOOOO");
            return -1;
        }
        
        public PairMatch(int a, int b)
        {
            A=Math.min(a,b);
            B=Math.max(a,b);
        }
        
        public int compareTo(Object O)
        {
         
            PairMatch P=(PairMatch)O;
            
            if (A < P.A) return -1;
            if (A > P.A) return 1;
            if (B < P.B) return -1;
            if (B > P.B) return 1;
            
            return 0;
        }
        public boolean equals(Object O)
        {
            if ((O instanceof PairMatch) || (compareTo(O) == 0)) return true;
            return false;
        }
        
    }
    
    class PlayerInfo
    {
        int Number;
        String Name;
        int Win;
        int Loss;
        int Games;
        
        PlayerInfo(int num)
        {
            Number=num;
            Name="Unnamed" + num;
            Win=0;
            Loss=0;
            Games=0;
        }
        
        public String toString()
        {
            StringBuilder SB=new StringBuilder();
            
            SB.append(Number);
            SB.append(". ");
            SB.append(Name);
            SB.append(": ");
            SB.append(Win);
            SB.append("-");
            SB.append(Loss);
            
            return SB.toString();
            
            
        }
        
    }
    
    class AvailSearch
    {
        TreeSet<Integer> Avail;
        int MaxPair;
        
        TreeSet<PairMatch> BestOption;
        AvailSearch(TreeSet<Integer> avail)
        {
            Avail=avail;
            MaxPair=Avail.size()/2;
            BestOption=new TreeSet<PairMatch>();
            
            

            search(Avail,new TreeSet<PairMatch>());
            
            System.out.println("Matches that can start: " + BestOption.size());
            for(PairMatch P : BestOption)
            {
                System.out.println(getPlayerName(P.A) + " vs " + getPlayerName(P.B));
            }
            
        }
        
        void search(Set<Integer> Left,TreeSet<PairMatch> Sol)
        {
            if (Sol.size() > BestOption.size())
            {
                BestOption=Sol;
            }
            if (BestOption.size()==MaxPair) return;
            
            LinkedList<Integer> L1=getRandomPerm(Left);
            LinkedList<Integer> L2=getRandomPerm(Left);
            for(Integer A : L1)
            for(Integer B : L2)
            {
                int a=A;
                int b=B;
                if (a!=b)
                {
                    if (!hasMatch(a,b))
                    {
                        TreeSet<Integer> Left2=new TreeSet<Integer>(Left);
                        TreeSet<PairMatch> Sol2=new TreeSet<PairMatch>(Sol);
                        Sol2.add(new PairMatch(a,b));
                        
                        Left2.remove(A);
                        Left2.remove(B);
                        search(Left2,Sol2);
                        
                    }
                }
                
            }
            
        }
        
        LinkedList<Integer> getRandomPerm(Set<Integer> E)
        {
            LinkedList<Integer> P=new LinkedList<Integer>();
            
            TreeMap<Long,Integer> M=new TreeMap<Long,Integer>();
            for(Integer I : E)
            {
                long L=PRNG.nextLong();
                while(M.containsKey(L)) L=PRNG.nextLong();
                M.put(L,I);
            }
            
            for(Integer I : M.values())
            {
                P.add(I);
            }
            
            return P;
            
        }
        
        
    }

}