Submission #8449887

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 //10^9+7
#define div 998244353
#define rep(i,n) for(int i=0;i<n;i++)
int n;
string w[150];
set<string>st;
signed main(){
    cin>>n;
    cin>>w[0];
    st.insert(w[0]);
    for(int i=1;i<n;i++){
        cin>>w[i];
        st.insert(w[i]);
        int l=w[i-1].size();
        if(i%2){
            int x=0;
            if(st.size()!=i+1)x++;
            else if(w[i-1][l-1]!=w[i][0])x++;
            if(x){
                puts("WIN");
                return 0;
            }
        }
        else{
            int x=0;
            if(st.size()!=i+1)x++;
            else if(w[i-1][l-1]!=w[i][0])x++;
            if(x){
                puts("LOSE");
                return 0;
            }
        }
    }
    puts("DRAW");
    return 0;
}

Submission Info

Judge Result