Problem212&241&2478&248 upd (#83)

* Update problem 211 and 220

* Update problem 239&241

* 243&247&248submit and 239&241 statement's upd

* 239 statement upd

* Problem212&241&247&248upd

Author: lindongli2004

algorithmic/problems/212/chk.cc

@@ -5,9 +5,9 @@
 
 using namespace std;
 
-const int N = 5002021;
+const int N = 202021;
 bool vis[N * 50];
-int n, m, L, R, Sx, Sy, qn, q[N], x[N], y[N], vis1[N];
+int n, m, L, R, Sx, Sy, qn, q[N], x[N], y[N], vis1[N],stk[N];
 
 int _abs(int x) {
     return (x < 0) ? (-x) : x;
@@ -101,20 +101,31 @@ int main(int argc, char* argv[]) {
 
     // Check row completion constraint
     memset(vis1, 0, sizeof(vis1));
+    int top=0;
     for (int i = 1; i <= cnt; i++) {
         if (y[i] < L || y[i] > R) continue;
         if (vis1[x[i]]) continue;
         vis1[x[i]] = 1;
+        stk[++top]=x[i];
         // When first entering row x[i]'s required area, must complete all required cells in that row
         for (int j = L; j <= R; j++) {
             int idx = j - L + i;
             if (idx > cnt) break;
-            if ((y[idx] < L || y[idx] > R) && x[idx] == x[i]) {
+            if(x[idx] != x[i])
+            	quitf(_wa, "Row %d: after entering required area, cannot leave before completing all required cells", x[i]);
+            if (y[idx] < L || y[idx] > R) {
                 quitf(_wa, "Row %d: after entering required area, cannot leave before completing all required cells", x[i]);
             }
         }
     }
 
+    if(top!=n)
+    	quitf(_wa, "Required cell is not visited");
+    int nw=1;
+    for(int i=1;i<=qn;i++){
+    	while(nw<=top && q[i]!=stk[nw])++nw;
+    	if(stk[nw]!=q[i])quitf(_wa, "Your clearance sequence does not contain the required subsequence");
+    }
     // Calculate score (0-10 points)
     double points = 0;
     if (cnt <= mxstp) {

algorithmic/problems/241/config.yaml

@@ -11,4 +11,4 @@ memory: 512m
 # The subtasks section
 subtasks:
   - score: 100
-    n_cases: 4  # Test cases: 1.in, 2.in, ..., 10.in in testdata/
+    n_cases: 5  # Test cases: 1.in, 2.in, ..., 10.in in testdata/

algorithmic/problems/241/statement.txt

@@ -74,6 +74,7 @@ Your score is calculated based on the number of (&,|) $m$, and $m_0$(number of (
 if $m \leq m_0$, you receive full score (1.0).
 if $m>2 * m_0$, you receive 0 score.
 otherwise Score = $(2 * m_0 - m) / (m_0)$, linearly decreasing from 1.0 to 0.0.
+The score for a test point is the minimum score among all test data within it
 
 Time limit:
 2 seconds

algorithmic/problems/241/testdata/1.ans

@@ -1,22 +1,7 @@
 Yes
 F
 No
-No
-No
-No
-No
-No
-No
-Yes
-(a&b)
-No
 Yes
 a
-No
-Yes
-b
-No
-Yes
-(a|b)
 Yes
 T

algorithmic/problems/241/testdata/1.in

@@ -1,33 +1,9 @@
-16
-2
-0000
-2
-1000
-2
-0100
-2
-1100
-2
-0010
-2
-1010
-2
-0110
-2
-1110
-2
-0001
-2
-1001
-2
-0101
-2
-1101
-2
-0011
-2
-1011
-2
-0111
-2
-1111
+4
+1
+00
+1
+10
+1
+01
+1
+11

algorithmic/problems/241/testdata/2.ans

@@ -1,2 +1,22 @@
 Yes
-((((((((a&b)&c)&d)|((((a&b)&c)|(((a&b)|((a|b)&c))&d))&e))|(((((a&b)&c)|(((a&b)|((a|b)&c))&d))|((((a&b)|((a|b)&c))|(((a|b)|c)&d))&e))&f))|((((((a&b)&c)|(((a&b)|((a|b)&c))&d))|((((a&b)|((a|b)&c))|(((a|b)|c)&d))&e))|(((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))&f))&g))|(((((((a&b)&c)|(((a&b)|((a|b)&c))&d))|((((a&b)|((a|b)&c))|(((a|b)|c)&d))&e))|(((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))&f))|((((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))|(((((a|b)|c)|d)|e)&f))&g))&h))|((((((((a&b)&c)|(((a&b)|((a|b)&c))&d))|((((a&b)|((a|b)&c))|(((a|b)|c)&d))&e))|(((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))&f))|((((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))|(((((a|b)|c)|d)|e)&f))&g))|(((((((a&b)|((a|b)&c))|(((a|b)|c)&d))|((((a|b)|c)|d)&e))|(((((a|b)|c)|d)|e)&f))|((((((a|b)|c)|d)|e)|f)&g))&h))&i))
+F
+No
+No
+No
+No
+No
+No
+No
+Yes
+(a&b)
+No
+Yes
+a
+No
+Yes
+b
+No
+Yes
+(a|b)
+Yes
+T

algorithmic/problems/241/testdata/2.in

@@ -1,3 +1,33 @@
-1
-9
-00000000000000010000000100010111000000010001011100010111011111110000000100010111000101110111111100010111011111110111111111111111000000010001011100010111011111110001011101111111011111111111111100010111011111110111111111111111011111111111111111111111111111110000000100010111000101110111111100010111011111110111111111111111000101110111111101111111111111110111111111111111111111111111111100010111011111110111111111111111011111111111111111111111111111110111111111111111111111111111111111111111111111111111111111111111
+16
+2
+0000
+2
+1000
+2
+0100
+2
+1100
+2
+0010
+2
+1010
+2
+0110
+2
+1110
+2
+0001
+2
+1001
+2
+0101
+2
+1101
+2
+0011
+2
+1011
+2
+0111
+2
+1111