oj.uz

Submission #199828

# Submission time Handle Problem Language Result Execution time Memory
199828 2020-02-03T14:43:55 Z mathking1021 None (JOI16_memory2) C++11
0 / 100
 5 ms 376 KB 
#include "Memory2_lib.h"
#include <algorithm>
#include <vector>

using namespace std;

int a[105];
bool v[105];
vector<int> ve[105];
vector<int> ans[105];

void Solve(int T, int N)
{
    int n = N;
    for(int i = 0; i < 2 * n; i++)
    {
        int j;
        int x = n;
        if(v[i]) continue;
        for(j = 0; j < n; j++) ve[j].clear();
        for(j = i + 1; j < 2 * n; j++)
        {
            if(v[j]) continue;
            int t = Flip(i, j);
            ve[t].push_back(j);
            if(ve[t].size() > 2) {x = t;break;}
        }
        for(int k = 0; k < n; k++) if(k != x) for(int l = 0; l < ve[k].size(); l++) ans[k].push_back(ve[k][l]);
        if(j == 2 * n)
        {
            for(j = 0; j < n; j++)
            {
                if(ans[j].size() < 2) ans[j].push_back(i);
                Answer(ans[j][0], ans[j][1], j);
            }
            return;
        }
        ans[x].push_back(i);
        v[i] = true;
        for(j = 0; j < n; j++)
        {
            if(j == x) continue;
            for(int k = 0; k < ve[j].size(); k++)
            {
                v[ve[j][k]] = true;
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        Answer(ans[i][0], ans[i][1], i);
    }
	return;
}

Compilation message

memory2.cpp: In function 'void Solve(int, int)':
memory2.cpp:28:64: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int k = 0; k < n; k++) if(k != x) for(int l = 0; l < ve[k].size(); l++) ans[k].push_back(ve[k][l]);
                                                              ~~^~~~~~~~~~~~~~
memory2.cpp:43:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k = 0; k < ve[j].size(); k++)
                            ~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Wrong Answer[3]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Incorrect 5 ms 256 KB Wrong Answer[3]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Wrong Answer[3]
2 Halted 0 ms 0 KB -