NOIP T1 求hack
  • 板块学术版
  • 楼主Andycode3759
  • 当前回复13
  • 已保存回复13
  • 发布时间2023/11/20 16:57
  • 上次更新2023/11/20 20:10:15
查看原帖
NOIP T1 求hack
837308
Andycode3759楼主2023/11/20 16:57

洛谷数据 WA #7,云斗 AC

请问是哪里错了?能不能给个hack数据?

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

const int MAXN = 3010;

int n, m;
string raw[MAXN], arr[MAXN];

char buf[MAXN];
bool charCmp(char a, char b)
{
    return a > b;
}

int main()
{
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        scanf("%s", buf);
        raw[i] = string(buf);
        sort(buf, buf + m, charCmp);
        arr[i] = string(buf);
    }
    string m = arr[1];
    for (int i = 1; i <= n; i++)
        m = min(m, arr[i]);
    for (int i = 1; i <= n; i++)
    {
        string s = raw[i];
        sort(s.begin(), s.end());
        if (s <= m)
            printf("1");
        else
            printf("0");
    }
    printf("\n");
    return 0;
}
2023/11/20 16:57
加载中...