제출 #66482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66482		hamzqq9	Ili (COI17_ili)	C++14	100 / 100	565 ms	2584 KiB

ili

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define sz(x) (x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 1000000000
#define MOD 1000000007
#define N 20005
#define MAX 10000006
#define LOG 20
using namespace std;
 
struct cur {

	int val[N];

} now[2];

ii go[N];
int n,m;
char s[N],a[55];
 
int get_num(int bas,int son) {
 
	int res=0;
 
	for(int i=bas;i<=son;i++) {
 
		int dig=a[i]-'0';
 
		res=res*10+dig;
 
	}
 
	return res;
 
}
 
int parse() {
 
	int len=strlen(a+1);
 
	int add=(a[1]=='x'?0:n);
 
	return add+get_num(2,len);
 
}
 
bool check() {

	for(int i=n+m;i>=n+1;i--) {

		if(now[1].val[i]==0) {

			if(now[1].val[go[i].st]==1 || now[1].val[go[i].nd]==1) return false;

			now[1].val[go[i].st]=0; 
			now[1].val[go[i].nd]=0;

		}

	}

	for(int i=n+1;i<=n+m;i++) {

		if(now[1].val[go[i].st]==0 && now[1].val[go[i].nd]==0) {

			if(now[1].val[i]==1) return false;

			now[1].val[i]=0;

		}

	}

	return true;

}

int main() {
 
//	freopen("input.txt","r",stdin);
 
	scanf("%d %d",&n,&m);
 
	scanf("%s",s+1);
 
	for(int i=1;i<=m;i++) {
 
		scanf("%s",a+1);
 
		int node1=parse();
 
		scanf("%s",a+1);
 
		int node2=parse();
 
		go[n+i]={node1,node2};
 
	}
 	
	for(int i=1;i<=n;i++) {

		now[0].val[i]=2;

	}

	for(int i=n+1;i<=n+m;i++) {

		if(s[i-n]=='?') now[0].val[i]=2;
		else now[0].val[i]=s[i-n]-'0';

	}

 	for(int i=n+m;i>=n+1;i--) {

 		if(now[0].val[i]==0) {

 			now[0].val[go[i].st]=0;
			now[0].val[go[i].nd]=0;

 		}

 	}

 	for(int i=n+1;i<=n+m;i++) {

 		if(now[0].val[go[i].st]==0 && now[0].val[go[i].nd]==0) {

 			now[0].val[i]=0;

 		}

 	}

 	for(int i=n+1;i<=n+m;i++) {

 		if(now[0].val[i]==2) {

 			for(int j=1;j<=n+m;j++) now[1].val[j]=now[0].val[j];

 			now[1].val[i]=0;

 			if(!check()) {

 				now[0].val[i]=1;

 			}

 		}

 	}

 	for(int i=n+1;i<=n+m;i++) {

 		if(now[0].val[i]==2) printf("?");
 		else printf("%c",'0'+now[0].val[i]);

 	}
 
}

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

ili.cpp: In function 'int main()':
ili.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
ili.cpp:97:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~
ili.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",a+1);
   ~~~~~^~~~~~~~~~
ili.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",a+1);
   ~~~~~^~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 42 / 42
• Subtask 3: 51 / 51