oj.uz

Submission #746800

# Submission time Handle Problem Language Result Execution time Memory
746800 2023-05-23T06:23:56 Z anusha777 Inside information (BOI21_servers) C++14
5 / 100
 251 ms 32320 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=4000+1, mod=1e9 + 9, inf=1e27+1;
using namespace std;
//vi dx= { 0, 1, 0 , -1} , dy= {-1,0, 1, 0};
int cnt[N];
bool dp[N][N];
void task()
{
    int n, k;
    cin>>n>>k;
    forr(i, 1, n+1)
    {
        cnt[i]=1;
        forr(j, 0, n+1) dp[i][j]=0;
        dp[i][i]=1;
    }
    forr(i, 0, n+k-1)
    {
        char ch;
        int a, b;
        cin>>ch;
        if(ch=='S')
        {
            cin>>a>>b;
            forr(i, 1, n+1)
            {
                if(dp[a][i] and !dp[b][i])
                {
                    cnt[i]++;
                    dp[b][i]=1;
                }
                swap(a,b);
                if(dp[a][i] and !dp[b][i])
                {
                    cnt[i]++;
                    dp[b][i]=1;
                }
            }
        }
        else if(ch=='Q')
        {
            cin>>a>>b;
            if(dp[a][b]) cout<<"yes"<<endl;
            else cout<<"no"<<endl;
        }
        else{
            cin>>a;
            cout<<cnt[a]<<endl;
        }
    }
}
signed main()
{
	fast;
	int t;
	t=1;
	//cin>>t;
	while(t--) task();
}

Compilation message

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

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1736 KB Output is correct
2 Correct 196 ms 17708 KB Output is correct
3 Correct 221 ms 17780 KB Output is correct
4 Correct 202 ms 17872 KB Output is correct
5 Correct 198 ms 17664 KB Output is correct
6 Correct 234 ms 17812 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1736 KB Output is correct
2 Correct 196 ms 17708 KB Output is correct
3 Correct 221 ms 17780 KB Output is correct
4 Correct 202 ms 17872 KB Output is correct
5 Correct 198 ms 17664 KB Output is correct
6 Correct 234 ms 17812 KB Output is correct
7 Correct 155 ms 1656 KB Output is correct
8 Correct 190 ms 17336 KB Output is correct
9 Correct 221 ms 17412 KB Output is correct
10 Correct 195 ms 17316 KB Output is correct
11 Correct 203 ms 17404 KB Output is correct
12 Correct 236 ms 17492 KB Output is correct

Subtask #3
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 159 ms 1740 KB Output is correct
2 Runtime error 39 ms 32252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 159 ms 1740 KB Output is correct
2 Runtime error 39 ms 32252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1640 KB Output is correct
2 Runtime error 40 ms 32208 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1640 KB Output is correct
2 Runtime error 40 ms 32208 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 1676 KB Output is correct
2 Runtime error 31 ms 32320 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 1676 KB Output is correct
2 Runtime error 31 ms 32320 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 167 ms 1740 KB Output is correct
2 Runtime error 38 ms 32252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 167 ms 1740 KB Output is correct
2 Runtime error 38 ms 32252 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1776 KB Output is correct
2 Correct 207 ms 17700 KB Output is correct
3 Correct 228 ms 17768 KB Output is correct
4 Correct 231 ms 17704 KB Output is correct
5 Correct 203 ms 17836 KB Output is correct
6 Correct 251 ms 17792 KB Output is correct
7 Correct 158 ms 1724 KB Output is correct
8 Runtime error 32 ms 32264 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1776 KB Output is correct
2 Correct 207 ms 17700 KB Output is correct
3 Correct 228 ms 17768 KB Output is correct
4 Correct 231 ms 17704 KB Output is correct
5 Correct 203 ms 17836 KB Output is correct
6 Correct 251 ms 17792 KB Output is correct
7 Correct 158 ms 1724 KB Output is correct
8 Runtime error 32 ms 32264 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -