oj.uz

답안 #1072709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072709 2024-08-24T03:12:39 Z mindiyak Inside information (BOI21_servers) C++17
2.5 / 100
 3500 ms 524288 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

void solve()
{   
    int N,K;cin >> N >> K;
    vector<set<int>> mem(N);

    FOR(i,0,N)mem[i].insert(i);

    FOR(i,0,N+K-1){
        char a;cin >> a;
        if(a == 'S'){
            int c,d;cin >> c >> d;c--;d--;
            for(int p:mem[c])mem[d].insert(p);
            for(int p:mem[d])mem[c].insert(p);
        }else if(a == 'Q'){
            int c,d;cin >> c >> d;c--;d--;
            if(mem[c].count(d))cout << "yes" << endl;
            else cout << "no" << endl;
        }else{
            int c;cin >> c;c--;
            int p = 0;
            FOR(q,0,N)if(mem[q].count(c))p++;
            cout << p << endl;
        }
    }
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

servers.cpp: In function 'void init(std::string)':
servers.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
servers.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 1620 KB Output is correct
2 Correct 136 ms 3664 KB Output is correct
3 Correct 319 ms 48976 KB Output is correct
4 Correct 141 ms 3152 KB Output is correct
5 Correct 142 ms 3152 KB Output is correct
6 Correct 1620 ms 378312 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 1620 KB Output is correct
2 Correct 136 ms 3664 KB Output is correct
3 Correct 319 ms 48976 KB Output is correct
4 Correct 141 ms 3152 KB Output is correct
5 Correct 142 ms 3152 KB Output is correct
6 Correct 1620 ms 378312 KB Output is correct
7 Correct 133 ms 1616 KB Output is correct
8 Correct 2710 ms 3168 KB Output is correct
9 Execution timed out 3572 ms 25412 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 1620 KB Output is correct
2 Runtime error 1625 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 1620 KB Output is correct
2 Runtime error 1625 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 1616 KB Output is correct
2 Correct 233 ms 34640 KB Output is correct
3 Correct 259 ms 34908 KB Output is correct
4 Runtime error 747 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 1616 KB Output is correct
2 Correct 233 ms 34640 KB Output is correct
3 Correct 259 ms 34908 KB Output is correct
4 Runtime error 747 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 1556 KB Output is correct
2 Runtime error 2105 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 1556 KB Output is correct
2 Runtime error 2105 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 1620 KB Output is correct
2 Correct 247 ms 34608 KB Output is correct
3 Correct 243 ms 34828 KB Output is correct
4 Runtime error 734 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 1620 KB Output is correct
2 Correct 247 ms 34608 KB Output is correct
3 Correct 243 ms 34828 KB Output is correct
4 Runtime error 734 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 154 ms 1576 KB Output is correct
2 Correct 137 ms 3548 KB Output is correct
3 Correct 319 ms 48980 KB Output is correct
4 Correct 152 ms 3152 KB Output is correct
5 Correct 170 ms 3156 KB Output is correct
6 Correct 1620 ms 378308 KB Output is correct
7 Correct 129 ms 1584 KB Output is correct
8 Runtime error 1592 ms 524288 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 154 ms 1576 KB Output is correct
2 Correct 137 ms 3548 KB Output is correct
3 Correct 319 ms 48980 KB Output is correct
4 Correct 152 ms 3152 KB Output is correct
5 Correct 170 ms 3156 KB Output is correct
6 Correct 1620 ms 378308 KB Output is correct
7 Correct 129 ms 1584 KB Output is correct
8 Runtime error 1592 ms 524288 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -