Submission #1096323

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096323		vjudge1	Inside information (BOI21_servers)	C++17	0 / 100	1860 ms	524288 KiB

servers

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int N=1.2e5+10;
vector<int>rec[N]; 
int main(){
	int n,k,x,y;char s;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;++i){
		rec[i].push_back(i);
	}
	for(int i=1;i<=n+k-1;++i){
		cin>>s;
		if(s=='S'){
			scanf("%d%d",&x,&y);
			for(int i:rec[x])rec[y].push_back(i);
			for(int i:rec[y])rec[x].push_back(i);
			unique(rec[y].begin(),rec[y].end());
			unique(rec[x].begin(),rec[x].end());
		}else if(s=='Q'){
			scanf("%d%d",&x,&y);
			bool ju=0;
			for(int i:rec[x]){
				if(i==y){
					ju=1;
					printf("yes\n");
					break;
				}
			}
			if(ju==0)printf("no\n");
		}else{
			scanf("%d",&x);
			int cntt=0;
			for(int i=1;i<=n;++i){
				for(int j:rec[i]){
					if(j==x){
						++cntt;
						break;
					}
				}
			}
			printf("%d\n",cntt);
		}
	}
} 

Compilation message (stderr)

servers.cpp: In function 'int main()':
servers.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d%d",&n,&k);
      |  ~~~~~^~~~~~~~~~~~~~
servers.cpp:17:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |    scanf("%d%d",&x,&y);
      |    ~~~~~^~~~~~~~~~~~~~
servers.cpp:23:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |    scanf("%d%d",&x,&y);
      |    ~~~~~^~~~~~~~~~~~~~
servers.cpp:34:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |    scanf("%d",&x);
      |    ~~~~~^~~~~~~~~

• Subtask 1: 0 / 2.5
• Subtask 2: 0 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5