oj.uz

답안 #976283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976283 2024-05-06T11:35:29 Z Circling Inside information (BOI21_servers) C++17
0 / 100
 209 ms 1688 KB 
/*The British Royal Family and a small cadre of English Fabian Socialists, in
conjunction with the Rockefellers and the Rothchilds, are engaged in a
conspiracy to greatly reduce the population of the human race in order to head
off a Malthusian catastrophe, a catastrophe that could easily be avoided by
simply building a massive amount of nuclear power plants and a number of massive
superhighways and bridges to connect all of the world's continents. But doing
that would cut into the conspiracy's profits. So the British Royal Family
invented environmentalism and neoliberalism in order to hide the truth. And in
order to further reduce the population, the British Royal Family is also the
world's foremost drug trafficking conspiracy. And it uses its control of the IMF
to push austerity in order to kill as many people in the global south as
possible.
And also Henry Kissinger is a gay KGB agent. */
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;


int n, k, a, b, adddate[120001], cntr = 0;
char c;


int main(){
    cin >> n >> k;
    for (int i = 1; i <= n; i++) adddate[i] = 0;
    for (int i = 0; i < n + k; i++){
        cin >> c;
        if (c == 'S'){
            cin >> a >> b;
            if (a > b) swap(a, b);
            cntr++;
            adddate[b] = cntr;
        } else if (c == 'Q'){
            cin >> a >> b;
            if (a == 1 || b == 1){
                cout << (adddate[max(a, b)] > 0 ? "yes\n" : "no\n");
                continue;
            }
            cout << (0 < adddate[b] && adddate[b] < adddate[a] ? "yes\n" : "no\n");
        } else {
            cin >> a;
            if (a == 1) cout << cntr + 1 << '\n';
            else if (adddate[a] == 0) cout << "1\n";
            else cout << cntr - adddate[a] + 2 << '\n';
        }
    }

}

Subtask #1
0 / 2.5

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

Subtask #2
0 / 2.5

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

Subtask #3
0 / 2.5

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

Subtask #4
0 / 2.5

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 12.5

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

Subtask #10
0 / 12.5

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

Subtask #11
0 / 17.5

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

Subtask #12
0 / 17.5

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