Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

const fi='';
var n,m,dem,t,i,j:longint; code:integer;
    re:int64;
    s:string;
    x,y:array[1..50] of longint;

begin
     assign(input,fi); reset(input);
     while true do
     begin
          readln(s);
          if s='[END]' then break;
          if s='[CASE]' then
          begin
               readln(n,m);
               re:=int64(n)*(m-1);
               dem:=0;
               readln(s);
               while true do
               begin
                    readln(s);
                    if s='>>' then break;
                    val(s,t,code);
                    inc(dem);
                    x[dem]:=t;
               end;
               readln(s);
               dem:=0;
               while true do
               begin
                    readln(s);
                    if s='>>' then break;
                    val(s,t,code);
                    inc(dem);
                    y[dem]:=t;
               end;
               for i:=1 to dem-1 do
                 for j:=i+1 to dem do
                   if (x[i]>x[j]) or ((x[i]=x[j]) and (y[i]>y[j])) then
                   begin
                        t:=x[i]; x[i]:=x[j]; x[j]:=t;
                        t:=y[i]; y[i]:=y[j]; y[j]:=t;
                   end;
               for i:=1 to dem do
               begin
                    dec(re,2);
                    if (y[i]=1) or (y[i]=m) then inc(re);
                    if (i>1) and ((x[i]=x[i-1]) and (y[i]=y[i-1]+1)) then inc(re);
               end;
               if m=1 then writeln(0) else writeln(re);
          end;
     end;
     close(input);
end.

Code mẫu của happyboy99x

#include<algorithm>
#include<cstdlib>
#include<cstdio>
using namespace std;

typedef long long Long;

char tmp[100];
int read(int * a) {
    int n = 0;
    for(scanf("%s", tmp); scanf("%s", tmp) && tmp[0] != '>'; a[n++] = atoi(tmp));
    return n;
}

int r[50], s[50];
pair<int, int> p[50];

int main() {
    for(int n, m; scanf("%*s%d%d", &n, &m) == 2; ) {
        int q = read(r); read(s);
        for(int i = 0; i < q; ++i) p[i] = pair<int, int>(r[i], s[i]);
        sort(p, p+q);
        Long res = max(0, p[0].second - 2);
        int rem = n - 1;
        for(int i = 1; i < q; ++i) {
            if(p[i].first != p[i-1].first) {
                --rem;
                res += max(0, m - p[i-1].second - 1) + max(0, p[i].second - 2);
            } else res += max(0, p[i].second - p[i-1].second - 2);
        }
        res += max(0, m - p[q-1].second - 1) + (Long) rem * (m-1);
        printf("%lld\n", res);
    }
    return 0;
}

Code mẫu của RR

#include <iostream>
#define FOR(i,a,b) for(long i=a; i<=b; i++)
#define P pair<int,int>
#define F first
#define S second
using namespace std;
char s[20];

int m,n,k;
long long res;
P a[50];

int main() {
    cin>>s; //Case
    while (scanf("%d %d\n",&m,&n)==2) {
        res=(long long)m*(n-1);
        cin>>s; //<<
        cin>>s; //num
        k=0;
        while (s[0]!='>') {
            k++;
            sscanf(s,"%d",&a[k].F);
            cin>>s;
        }
        cin>>s; //<<
        FOR(i,1,k) scanf("%d",&a[i].S);
        cin>>s; //>>

        sort(a+1,a+k+1);        

        FOR(i,1,k) {
            if (a[i].S>1) res--;
            if (a[i].S==n) res=res;
            else if (i<k && a[i+1].S==a[i].S+1 && a[i+1].F==a[i].F) res=res;
            else res--;
        }
        cout<<res<<endl;
        cin>>s;
    }
    return 0;
}

Code mẫu của hieult

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//#include <conio.h>

int main()
{
   // freopen("MOVIES.inp","r",stdin);
    char s[12];
    long long n,m;
    while(gets(s)>0)
    {
        if(s[0]!='[')
            continue;
        else if(s[1]=='E')
            break;
        else
        {
            scanf("%lld %lld",&n,&m);
           // printf("\n*** %lld   %lld  *",n,m);
            gets(s);
            gets(s);
            int t=0,x[50],y[50],free[50];
            while(gets(s)>0&&s[0]!='>')
            {
                 t++;
                 x[t]=atoi(s);
            }
            for(int i=1;i<=t;i++)
                free[i]=0;
            gets(s);
            t=0; 
            while(gets(s)>0&&s[0]!='>')
            {
                 t++;
                 y[t]=atoi(s);
                 for(int i=1;i<t;i++)
                     if(x[i]==x[t]&&y[i]==y[t])
                         free[t]=1;
            }

            int sl = 0;
            for(int i=1;i<=t;i++)
            {
               // printf("\n*** %d   %d  ***",x[i],y[i]);
                  if(free[i]!=0)
                       continue;
                  else
                  {
                      //printf("\n*** %d   %d  ***",x[i],y[i]);
                      int ga=2;
                      if(y[i]==1)
                          ga=1;
                      for(int j=1;j<=t;j++)
                      {
                          if(i==j)
                               continue;
                          else
                          {
                              if(x[j]==x[i]&&y[j]+1==y[i])
                              {
                                  ga=1;
                                  break;
                              }
                          }
                      }
                      sl=sl+ga;
                      if(y[i]==m)
                          sl--;
                  }

            }
            printf("%lld\n",n*(m-1)-sl);
        }
    }
   // getch();
}

Code mẫu của ll931110

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;

int n,m;
vector<int> a,b;
vector< pair<int,int> > v;

ll solve()
{
   if (m == 1) return 0;
   ll ret = 1LL * n * (m - 1);
   v.clear();
   v.push_back(make_pair(0,0));
   for (int i = 0; i < a.size(); i++) v.push_back(make_pair(a[i],b[i]));
   sort(v.begin(),v.end());
   for (int i = 1; i < v.size(); i++)
   {
       int dec = 2;
       if (v[i].first == v[i - 1].first && v[i].second == v[i - 1].second + 1) dec--;
       if (v[i].second == 1 || v[i].second == m) dec--;
       ret -= dec;
   };
   return ret;
};

int main()
{
//    freopen("movie.in","r",stdin);
//    freopen("movie.ou","w",stdout);
    string s;
    while (1)
    {
          cin >> s;
          if (s == "[END]") break;
          a.clear();  b.clear();
          cin >> n >> m;
          cin >> s;
          while (1)
          {
                cin >> s;
                if (s == ">>") break;
                stringstream w; int x;
                w << s; w >> x;  a.push_back(x);
          };
          cin >> s;
          while (1)
          {
                cin >> s;
                if (s == ">>") break;
                stringstream w;  int x;
                w << s;  w >> x;  b.push_back(x);
          };
          cout << solve() << endl;
    };
};