답안 #1072714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072714 2024-08-24T03:16:45 Z mindiyak Inside information (BOI21_servers) C++14
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+5);

    FOR(i,0,N+3)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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 576 KB Output is correct
2 Correct 201 ms 2304 KB Output is correct
3 Correct 320 ms 47796 KB Output is correct
4 Correct 148 ms 2128 KB Output is correct
5 Correct 146 ms 1804 KB Output is correct
6 Correct 1578 ms 376916 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 576 KB Output is correct
2 Correct 201 ms 2304 KB Output is correct
3 Correct 320 ms 47796 KB Output is correct
4 Correct 148 ms 2128 KB Output is correct
5 Correct 146 ms 1804 KB Output is correct
6 Correct 1578 ms 376916 KB Output is correct
7 Correct 129 ms 592 KB Output is correct
8 Correct 2634 ms 2208 KB Output is correct
9 Execution timed out 3533 ms 25236 KB Time limit exceeded
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 988 KB Output is correct
2 Runtime error 1579 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 988 KB Output is correct
2 Runtime error 1579 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 592 KB Output is correct
2 Correct 224 ms 31344 KB Output is correct
3 Correct 240 ms 31304 KB Output is correct
4 Runtime error 782 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 592 KB Output is correct
2 Correct 224 ms 31344 KB Output is correct
3 Correct 240 ms 31304 KB Output is correct
4 Runtime error 782 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 596 KB Output is correct
2 Runtime error 2102 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 596 KB Output is correct
2 Runtime error 2102 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 812 KB Output is correct
2 Correct 254 ms 31288 KB Output is correct
3 Correct 238 ms 31412 KB Output is correct
4 Runtime error 746 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 812 KB Output is correct
2 Correct 254 ms 31288 KB Output is correct
3 Correct 238 ms 31412 KB Output is correct
4 Runtime error 746 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 596 KB Output is correct
2 Correct 145 ms 2268 KB Output is correct
3 Correct 311 ms 47688 KB Output is correct
4 Correct 141 ms 1880 KB Output is correct
5 Correct 155 ms 1656 KB Output is correct
6 Correct 1479 ms 376912 KB Output is correct
7 Correct 137 ms 852 KB Output is correct
8 Runtime error 1541 ms 524288 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 596 KB Output is correct
2 Correct 145 ms 2268 KB Output is correct
3 Correct 311 ms 47688 KB Output is correct
4 Correct 141 ms 1880 KB Output is correct
5 Correct 155 ms 1656 KB Output is correct
6 Correct 1479 ms 376912 KB Output is correct
7 Correct 137 ms 852 KB Output is correct
8 Runtime error 1541 ms 524288 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -