oj.uz

답안 #899194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899194 2024-01-05T15:14:24 Z AIF_is_carving Inside information (BOI21_servers) C++17
2.5 / 100
 126 ms 9300 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

const int N=2e5+5;
map<int, int> graph;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k; cin>>n>>k;
    graph[1]=1;
    int count=1;

    for(int i=0; i<n+k-1; i++){
        char c; cin>>c;
        if(c=='S'){
            count+=1;
            int u, v; cin>>u>>v;
            graph[max(u,v)]=count;
        }
        else if(c=='Q'){
            int v, chunk; cin>>v>>chunk;
            if(graph[v]==0){
                if(v==chunk) cout<<"yes"<<"\n";
                else cout<<"no"<<"\n";
            }
            else{
                if(graph[chunk]==0) cout<<"no"<<"\n";
                else{
                    if(v==1) cout<<"yes"<<"\n";
                    else if(graph[v]>=graph[chunk]) cout<<"yes"<<"\n";
                    else cout<<"no"<<"\n";
                }
            }
        }
        else{
            int chunk; cin>>chunk;
            if(graph[chunk]==0){
                cout<<1<<"\n";
            }
            else{
                //cout<<graph.size()<<" "<<graph[chunk]<<" ";
                if(chunk==1) cout<<graph.size()<<"\n";
                else cout<<graph.size()-graph[chunk]+2<<"\n";
            }
        }

        // for(auto x: graph){
        //     cout<<x.first<<" "<<x.second<<"\n";
        // }
        // cout<<"\n"
    }

    return 0;
}

Subtask #1
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 600 KB Output is correct
2 Correct 121 ms 6268 KB Output is correct
3 Correct 126 ms 9300 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 600 KB Output is correct
2 Correct 121 ms 6268 KB Output is correct
3 Correct 126 ms 9300 KB Output is correct
4 Incorrect 23 ms 1628 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 616 KB Output isn't correct
2 Halted 0 ms 0 KB -