제출 #1227163

#제출 시각아이디문제언어결과실행 시간메모리
1227163dreamxhavaNaval battle (CEOI24_battle)C++20
0 / 100
3095 ms3648 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin>>n;
    long long x[n];
    long long y[n];
    char d[n];
    vector<bool>c(n,true);
    vector<bool>collided(n,false);
    for(int i=0;i<n;i++){
        cin>>x[i]>>y[i]>>d[i];
    }
    while(true){
        if(binary_search(c.begin(),c.end(),true)==false){
            break;
        }
        for(int i=0;i<n;i++){
            if(x[n]>=n||y[n]>=n){
                c[n]==false;
            }
            else{
                if(d[i]=='N'){ y[i]=y[i]-2;}
                if(d[i]=='S'){ y[i]=y[i]+2;}
                if(d[i]=='W'){ x[i]=x[i]-2;}
                if(d[i]=='E'){ x[i]=y[i]+2;}
                for(int i=0;i<n;i++){
                    for(int k=0;k<n;k++){
                        if(x[n]==x[k] && y[n]==y[k]){
                            collided[n]=true;
                        }
                    }
                }
            }
        }
    }


}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...