编号 题目 状态 分数 总时间 内存 代码 / 答案文件 提交者 提交时间
#15776 #1060. youngmagician爆肝抽卡手游 Accepted 100 1231 ms 12616 K C++ / 642 B 192024211519 2024-03-16 13:41:05
显示原始代码
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
    int m, n, i, j, s = 0, max;
    scanf("%d %d", &n, &m);
    int *flag = (int *)malloc(sizeof(int *) * m);
    for (i = 0; i < m; i++) {
        flag[i] = 0;
    }
    int **a = (int **)malloc(sizeof(int *) * n);
    for (i = 0; i < n; i++) {
        a[i] = (int *)malloc(sizeof(int *) * m);
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    for (i = 0; i < n; i++) {
        max = -1;
        for (j = 0; j < m; j++) {
            if (a[i][j] > max && flag[j] == 0) {
                max = a[i][j];
                s = j;
            }
        }
        flag[s] = 1;
    }
    for (i = 0; i < m; i++) {
        if (flag[i] == 1) {
            printf("1 ");
        } else {
            printf("0 ");
        }
    }
    return 0;
}
子任务 #1
Accepted
得分:100
测试点 #1
Accepted
得分:100
用时:228 ms
内存:12616 KiB

输入文件(2.in

647 3832
2595 3238 2024 2678 2515 1212 3408 1670 2592 1435 3727 2214 3613 1291 2366 3424 2243 739 4
<11681495 bytes omitted>

答案文件(2.out

0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 0 
<7566 bytes omitted>

用户输出

0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 
<7536 bytes omitted>

系统信息

Exited with return code 0
测试点 #2
Accepted
得分:100
用时:191 ms
内存:12060 KiB

输入文件(3.in

1000 2000
1255 1563 714 1801 986 517 1203 47 1865 1038 119 340 398 207 1986 1037 510 433 1049 1818 
<8894911 bytes omitted>

答案文件(3.out

1 1 1 0 0 0 1 1 0 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 0 0 0 
<3902 bytes omitted>

用户输出

1 1 1 0 0 0 1 1 0 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 
<3872 bytes omitted>

系统信息

Exited with return code 0
测试点 #3
Accepted
得分:100
用时:202 ms
内存:12072 KiB

输入文件(4.in

1000 2000
398 1992 494 729 842 825 1013 29 1288 1544 341 248 1850 706 1476 516 596 431 1755 1168 11
<8894911 bytes omitted>

答案文件(4.out

0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 0 0 1 
<3902 bytes omitted>

用户输出

0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 1 0 1 
<3872 bytes omitted>

系统信息

Exited with return code 0
测试点 #4
Accepted
得分:100
用时:201 ms
内存:12052 KiB

输入文件(5.in

1000 2000
1298 859 1921 1666 1460 790 203 1530 406 605 827 1972 723 438 106 713 593 974 181 1856 17
<8894911 bytes omitted>

答案文件(5.out

1 0 1 1 1 1 0 0 1 1 1 0 1 0 1 1 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 1 1 1 0 1 1 1 0 0 
<3902 bytes omitted>

用户输出

1 0 1 1 1 1 0 0 1 1 1 0 1 0 1 1 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 1 1 1 0 1 1 1 0 0 1 1 0 0 1 0 0 0 1 0 1 1 1 0 
<3872 bytes omitted>

系统信息

Exited with return code 0
测试点 #5
Accepted
得分:100
用时:195 ms
内存:12100 KiB

输入文件(6.in

1000 2000
1480 815 900 1261 241 845 178 1613 787 881 1522 1897 354 68 40 397 1887 1400 1593 1563 13
<8894911 bytes omitted>

答案文件(6.out

0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 0 0 1 1 1 0 1 1 1 1 0 1 1 0 1 0 0 0 1 1 1 1 
<3902 bytes omitted>

用户输出

0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 0 0 1 1 1 0 1 1 1 1 0 1 1 0 1 0 0 0 1 1 1 1 1 1 0 1 1 1 0 0 0 0 0 1 0 0 
<3872 bytes omitted>

系统信息

Exited with return code 0
测试点 #6
Accepted
得分:100
用时:214 ms
内存:12036 KiB

输入文件(7.in

1000 2000
414 380 896 547 199 1384 229 601 892 516 996 1185 860 1326 775 825 1360 511 1513 134 1573
<8894911 bytes omitted>

答案文件(7.out

1 0 1 1 0 0 1 1 1 1 1 0 1 1 0 1 1 1 0 0 0 1 0 1 1 1 1 1 0 1 0 0 1 1 0 0 0 1 1 0 0 1 1 1 0 0 0 1 1 0 
<3902 bytes omitted>

用户输出

1 0 1 1 0 0 1 1 1 1 1 0 1 1 0 1 1 1 0 0 0 1 0 1 1 1 1 1 0 1 0 0 1 1 0 0 0 1 1 0 0 1 1 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 
<3872 bytes omitted>

系统信息

Exited with return code 0