oj.uz

Submission #746838

# Submission time Handle Problem Language Result Execution time Memory
746838 2023-05-23T07:04:51 Z anusha777 Inside information (BOI21_servers) C++14
0 / 100
 186 ms 1340 KB 
#include <bits/stdc++.h>
#define fast 			ios::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL)
#define sz(x)			(int)((x).size())
#define pb				push_back
#define vi				vector<int>
#define vb				vector<bool>
#define vvb				vector<vb>
#define pi				pair<int,int>
#define vpi				vector<pi>
#define vvi				vector<vi>
#define vc				vector<char>
#define all(x)			x.begin(), x.end()
#define rall(x)			x.rbegin(), x.rend()
#define pbb()			pop_back()
#define f				first
#define s				second
#define ll				long long
#define int				long long
#define ull				unsigned long long
#define forr(i, a, b)	for(int i=a; i<b; i++)
const int N=120000+1, mod=1e9 + 9, inf=1e27+1;
using namespace std;
//vi dx= { 0, 1, 0 , -1} , dy= {-1,0, 1, 0};
int pos[N];
void task()
{
    int n, k;
    cin>>n>>k;
    forr(i, 1, n+1) pos[i]=inf;
    int added=0;
    forr(i, 0, n+k-1)
    {
        char ch;
        int a, b;
        cin>>ch;
        if(ch=='S')
        {
            cin>>a>>b;
            if(a>b) swap(a,b);
            added+=1;
            if(added==1) pos[a]=added;
            pos[b]=added;
        }
        else if(ch=='Q')
        {
            cin>>a>>b;
            if(a==b) cout<<"yes"<<endl;
            else if(pos[a]!=inf and pos[b]!=inf)
            {
                if(pos[b]<=pos[a]) cout<<"yes"<<endl;
                else cout<<"no"<<endl;
            }
            else cout<<"no"<<endl;
        }
        else{
            cin>>a;
            if(pos[a]==inf) cout<<1<<endl;
            else if(a==1) cout<<added<<endl;
            else cout<<added-pos[a]+2<<endl;
        }
    }
}
signed main()
{
	fast;
	int t;
	t=1;
	//cin>>t;
	while(t--) task();
}

Compilation message

servers.cpp:21:44: warning: overflow in conversion from 'double' to 'long long int' changes value from '1.0e+27' to '9223372036854775807' [-Woverflow]
   21 | const int N=120000+1, mod=1e9 + 9, inf=1e27+1;
      |                                        ~~~~^~

Subtask #1
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 1292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 1292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 157 ms 1340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 157 ms 1340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# Verdict Execution time Memory Grader output
1 Incorrect 186 ms 1280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Incorrect 186 ms 1280 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 1300 KB Output isn't correct
2 Halted 0 ms 0 KB -