损坏的RAID5

损坏的RAID5

string讀入卡cin

関同步 ios::sync_with_stdio(false)

由塊號映射到具體位置

塊號id對應第col個字符串

字符串開始的位置st

 #include<iostream>
 #include<string>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<queue>
 using namespace std;
 int n,s,l;
 bool vis[];
 string t[];
 int calraw(int id)
 {
     return id/(s*(n-));
 }
 int calcol(int id)
 {
     int st = (n-calraw(id)%n)%n;
     id -= (id/((n-)*s))*(n-)*s;
     int ans = (st + id/s)%n;
    // cout<<st<<" stid "<<id<<endl;
     return ans;
 }
 int st(int id)
 {
     int r=calraw(id);
     int ans=r**s+*(id%s);
     return ans;
 }
 int ati(char c)
 {
     if(c>='A'&&c<='Z')
     return c-'A'+;
     else return c-'';
 }
 char ita(int x)
 {
     if(x>=)
     return char(x-+'A');
     else return char(''+x);
 }
 string Xor(string s,string t)
 {
     string ans="";
     for(int i=;i<;i++){
          int a = ati(s[i]);
          int b = ati(t[i]);
          ans.append(,ita(a^b));
     }
     return ans;
 }
 int main()
 {
      ios::sync_with_stdio(false);
      cin>>n>>s>>l;
     int id;
     for(int i=;i<l;i++){
         cin>>id;
         cin>>t[id];
         vis[id]=;
     }
     int len=t[id].length();
     int m;
     cin>>m;

     for(int i=;i<m;i++){
           cin>>id;
           int x=calcol(id);
           if(vis[x]){
               int y =st(id);
               if(y>=len){
                   cout<<"-\n";
                   continue;
               }
               for(int i=y;i<y+;i++){
                   cout<<t[x][i];
               }
               cout<<'\n';
           }else if(!vis[x]&&l==n-){
                 int y =st(id);
                 string S="",T;
                 if(y>=len){
                   //puts("-");
                   cout<<"-\n";
                   continue;
                 }

                 for(int i=;i<n;i++){
                     if(vis[i]){
                         if(S==""){
                            S=t[i].substr(y,);
                         }else{
                             T=t[i].substr(y,);
                             S=Xor(S,T);
                         }
                     }
                 }
                 cout<<S<<'\n';
           }
           else{
               cout<<"-\n";
           }
     }

 }
 /**
 3 2 2
 0 000102030405060710111213141516172021222324252627
 1 A0A1A2A3A4A5A6A7B0B1B2B3B4B5B6B7C0C1C2C3C4C5C6C7
  2 1 2
 0 000102030405060710111213141516172021222324252627
 1 000102030405060710111213141516172021222324252627
 */

90分代碼：

由其餘已知的n-1個字符串預處理推出其餘一個字符串

查詢O(1)

預處理TLE了

#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include<cstring>
#include<cstdlib>
using namespace std;

int n, s, l;
bool vis[];
string t[];
int calraw(int id)
{
    return id / (s * (n - ));
}
int calcol(int id)
{
    int st = (n - calraw(id) % n) % n;
    id -= (id / ((n - ) * s)) * (n - ) * s;
    int ans = (st + id / s) % n;
    return ans;
}
int st(int id)
{
    int r = calraw(id);
    int ans = r *  * s +  * (id % s);
    return ans;
}
int ati(char c)
{
    if (c >= 'A' && c <= 'Z')
        return c - 'A' + ;
    else
        return c - '';
}
char ita(int x)
{
    if (x >= )
        return char(x -  + 'A');
    else
        return char('' + x);
}

bool tmp[];
int main()
{
    ios::sync_with_stdio(false);
    cin>>n>>s>>l;
    int id;
    for (int i = ; i < l; i++)
    {
        cin >> id;
        cin >> t[id];
        vis[id] = ;
    }
    int len = t[id].length();
    if (l == n - )
    {
        string ss="";
        int res=;

        for (int j = ; j < len; j++)
        {
            memset(tmp,,sizeof tmp);
            for (int i = ; i < n; i++)
            {
                  if(vis[i]&&t[i][j]>='A'&&t[i][j]<='Z'){
                      tmp[t[i][j]-'A'+]+=;
                      tmp[t[i][j]-'A'+]%=;
                  }else if(vis[i]){
                      tmp[t[i][j]-'']+=;
                      tmp[t[i][j]-'']%=;
                  }else if(!vis[i]){
                      res=i;
                  }
            }
            int cnt=;
            for(int k=;k<;k++){
                if(tmp[k])cnt^=k;
            }
            ss.append(,ita(cnt));

        }
        vis[res]=;
        t[res]=ss;

    }
    int m;
    cin >> m;

    for (int i = ; i < m; i++)
    {
        cin>>id;
        if(id>=(n-)*s*(len/(*s))){
            cout<<"-\n";
            continue;
        }
        int x = calcol(id);
        //cout<<x<<endl;
        if (vis[x])
        {
            int y = st(id);
            //  cout<<y<<endl;
            if (y >= t[x].length())
            {
                cout<<"-\n";
                continue;
            }
            for (int i = y; i < y + ; i++)
            {
                cout<<t[x][i];
            }
            cout<<"\n";
        }
        else
        {
            cout<<"-\n";
        }
    }
}
/**
3 2 2
0 000102030405060710111213141516172021222324252627
1 A0A1A2A3A4A5A6A7B0B1B2B3B4B5B6B7C0C1C2C3C4C5C6C7
 2 1 2
0 000102030405060710111213141516172021222324252627
1 000102030405060710111213141516172021222324252627
*/