제출 #1166588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166588		8pete8	Pictionary (COCI18_pictionary)	C++20	140 / 140	241 ms	8784 KiB

pictionary

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define sz(x) (int)((x).size())
#define int long long
using namespace std;
const int mod=1e9+7,mxn=2e5+5,inf=1e18,minf=-1e18,lg=30;
//#undef int
int n,k,m,d,q;
void setIO(string name){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}
int L[mxn+10],R[mxn+10];
int pa[mxn+10];
int find(int u){return pa[u]==u?u:pa[u]=find(pa[u]);}
void merge(int a,int b){
	a=find(a),b=find(b);
	if(a==b)return;
	pa[b]=a;
}
int mx[mxn+10];
int32_t main(){
    fastio		
	cin>>n>>m>>q;
	vector<pii>qry(q);
	for(int i=0;i<q;i++){
		cin>>qry[i].f>>qry[i].s;
		L[i]=1,R[i]=m;
	}
	for(int t=0;t<=lg;t++){
		vector<pii>have;
		for(int i=0;i<q;i++){
			if(L[i]>R[i])continue;
			have.pb({L[i]+(R[i]-L[i])/2,i});
		}
		sort(rall(have));
		int cur=m;
		for(int i=1;i<=n;i++)pa[i]=i;
		for(auto i:have){	
			while(cur>=i.f){
				for(int j=cur;j<=n;j+=cur)merge(j,cur);
				cur--;
			}
			if(find(qry[i.s].f)==find(qry[i.s].s))L[i.s]=i.f+1,mx[i.s]=max(mx[i.s],i.f);
			else R[i.s]=i.f-1;
		}
	}
	for(int i=0;i<q;i++)cout<<m-mx[i]+1<<'\n';
}
/*
*/

컴파일 시 표준 에러 (stderr) 메시지

pictionary.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   32 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
pictionary.cpp:39:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   39 | void setIO(string name){
      |                       ^
pictionary.cpp:46:15: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   46 | int find(int u){return pa[u]==u?u:pa[u]=find(pa[u]);}
      |               ^
pictionary.cpp:47:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   47 | void merge(int a,int b){
      |                       ^
pictionary.cpp:53:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   53 | int32_t main(){
      |              ^
pictionary.cpp: In function 'void setIO(std::string)':
pictionary.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((name+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pictionary.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14