답안 #1000120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1000120	2024-06-16T16:51:04 Z	Lcc735	장난감 기차 (IOI17_train)	C++17	0 / 100	6 ms	2396 KB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    int n=size(a);
    int m=size(u);
    vector<int> ans(n);
    vector <set<int>> st(n);
    set<int> ch;
    for(int i=0;i<n;i++){
        if(r[i]==1){
            ch.insert(i);
        }
    }
    for(int i=0;i<m;i++){
        st[u[i]].insert(v[i]);
    }
    vector<int> est(n);
    for (int i=0;i<n;i++){
        if(a[i]==0){
            if((st[i].count(i)==1)&&(ch.count(i)==0)){
                est[i]==0;
            }
            else if((st[i].count(i+1)==0)&&(ch.count(i)==1)){
                est[i]==1;
            }
            else{
                est[i]==2;
            }
        }
        else{
            if((st[i].count(i+1)==0)&&(ch.count(i)==0)){
                est[i]==0;
            }
            else if((st[i].count(i)==1)&&(ch.count(i)==1)){
                est[i]==1;
            }
            else{
                est[i]==2;
            }
        }
    }
    int rep=0;
    if(count(est.begin(),est.end(),2)==n){
        rep=1;
    }
    
    for (int i=0;i<n;i++){
        if(rep==0){
            if(est[i]==0){
                ans[i]==0;
            }
            else if(est[i]==1){
                ans[i]==1;
            }
            else{
                for(int j=i;j<n;j++){
                    if(est[j]==0){
                        ans[i]==0;
                        est[i]==0;
                    }
                    else if(est[j]==1){
                        ans[i]==1;
                        est[i]==1;
                    }
                }
                for(int j=0;j<i;j++){
                    if(est[j]==0){
                        ans[i]==0;
                        est[i]==0;
                    }
                    else if(est[j]==1){
                        ans[i]==1;
                        est[i]==1;
                    }
                }
            }
        }
        else{
            ans[i]=1;
        }
    }
    return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:23:23: warning: value computed is not used [-Wunused-value]
   23 |                 est[i]==0;
train.cpp:26:23: warning: value computed is not used [-Wunused-value]
   26 |                 est[i]==1;
train.cpp:29:23: warning: value computed is not used [-Wunused-value]
   29 |                 est[i]==2;
train.cpp:34:23: warning: value computed is not used [-Wunused-value]
   34 |                 est[i]==0;
train.cpp:37:23: warning: value computed is not used [-Wunused-value]
   37 |                 est[i]==1;
train.cpp:40:23: warning: value computed is not used [-Wunused-value]
   40 |                 est[i]==2;
train.cpp:52:23: warning: value computed is not used [-Wunused-value]
   52 |                 ans[i]==0;
train.cpp:55:23: warning: value computed is not used [-Wunused-value]
   55 |                 ans[i]==1;
train.cpp:60:31: warning: value computed is not used [-Wunused-value]
   60 |                         ans[i]==0;
train.cpp:61:31: warning: value computed is not used [-Wunused-value]
   61 |                         est[i]==0;
train.cpp:64:31: warning: value computed is not used [-Wunused-value]
   64 |                         ans[i]==1;
train.cpp:65:31: warning: value computed is not used [-Wunused-value]
   65 |                         est[i]==1;
train.cpp:70:31: warning: value computed is not used [-Wunused-value]
   70 |                         ans[i]==0;
train.cpp:71:31: warning: value computed is not used [-Wunused-value]
   71 |                         est[i]==0;
train.cpp:74:31: warning: value computed is not used [-Wunused-value]
   74 |                         ans[i]==1;
train.cpp:75:31: warning: value computed is not used [-Wunused-value]
   75 |                         est[i]==1;

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	3 ms	1368 KB	3rd lines differ - on the 14th token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 KB	3rd lines differ - on the 2nd token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	2140 KB	Output is correct
2	Correct	5 ms	2396 KB	Output is correct
3	Correct	6 ms	2396 KB	Output is correct
4	Incorrect	6 ms	2140 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-