Submission #244187

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
244187	2020-07-02 18:11:57	MatesV13	Ili (COI17_ili)	C++11	7 / 100	8 ms	512 KiB

ili

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int n, m, x[45], y[45]; string s;
int br1, br2; char c1, c2;
pair<int, int> gr[45]; 
bool firsttime=1;
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m; cin >> s;
for (int i=n+1; i<=n+m; i++){
  cin >> c1 >> br1 >> c2 >> br2; 
  if (c1=='c') br1+=n;
  if (c2=='c') br2+=n;
  gr[i] = make_pair(br1, br2);
}
for (int i=0; i<(1<<n); i++){
  int l=i;
  for (int j=1; j<=n; j++){
    x[j]=l%2; l/=2;
  }
  for (int j=n+1; j<=n+m; j++)
    x[j]=x[gr[j].first] || x[gr[j].second];
  bool ok=0;
  for (int j=n+1; j<=n+m; j++)
    if ((s[j-n-1]=='0' and x[j]==1) or (s[j-n-1]=='1' and x[j]==0))
      ok=1;
  if (ok) continue;
  if (firsttime){
    firsttime=0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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